Hall's Marriage Theorem
Hall's Theorem
Theorem that a finite bipartite graph has a perfect matching iff any subset of vertices from one group has a neighbourhood of equal or greater size.
Theorem that a finite bipartite graph has a perfect matching iff any subset of vertices from one group has a neighbourhood of equal or greater size.
Wikidata
