This video has the second part of the proof of Berge's theorem. We show that if graph G with a matching M has no M-augmenting paths then M is a maximum matching.
No download links available.
