by | Nov 22, 2025

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.