Hall marriage theorem
= Hall marriage theorem
{c}
{wiki=Hall's_marriage_theorem}
= Hall's marriage theorem
{c}
{synonym}
A bipartite graph has a matching saturating $X$ exactly when $|N(S)|\ge|S|$ for every $S\subseteq X$.
= Hall marriage theorem
{c}
{wiki=Hall's_marriage_theorem}
= Hall's marriage theorem
{c}
{synonym}
A bipartite graph has a matching saturating $X$ exactly when $|N(S)|\ge|S|$ for every $S\subseteq X$.