Course contentsShow
Mathematics
Lesson 2701 of 3,12153. Graph TheoryPro lesson

Augmenting Paths and Berge's Theorem

Define M-augmenting paths and prove Berge's theorem: a matching is maximum if and only if no augmenting path exists.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.