Matching in Bipartite Graphs and Hall's Marriage Theorem
Summary :Covers perfect matchings in bipartite graphs, Hall's Marriage Theorem with necessary and sufficient conditions, alternating and augmenting paths, and applications to assignment problems. Includes vertex covers and maximal partial matchings.