 Hall marriage theorem

A bipartite graph has a matching saturating $X$ exactly when $|N(S)|\ge |S|$ for every $S\subseteq X$.