Hall's marriage theorem
= Hall's marriage theorem
{wiki=Hall's_marriage_theorem}
Hall's Marriage Theorem is a result in combinatorial mathematics, specifically in the area of graph theory and bipartite matching. It provides a necessary and sufficient condition for the existence of a perfect matching in a bipartite graph.