Sean Li CS 4820 Notes Spring 2013 Introduction to Algorithms Lecture 18 3/1/13 Maximum Matchings in Bipartite Graphs.

s. Alternating path approach, and also the ow approach.

Adding a source and sink and setting all capacities to 1 turns this into a ow problem.

Halls Theorem. Let A X and let (A) denote the set of neighbors of vertices in A. Then there is a perfect matching if and only if for all A X, |(A)| |A|. Proof. Use max-ow min-cut theorem.