Course contentsShow
Computer Science
Lesson 1048 of 2,87224. Minimum Spanning Trees and Network FlowPro lesson

Hall's Marriage Theorem

State and prove Hall's theorem characterizing when a perfect matching exists in bipartite graphs.

This lesson is for subscribers

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