Regular bipartite graph has a perfect matching

In a $k$-regular bipartite graph, edge counting gives equal vertex-class sizes and $k|S|\le k|N(S)|$. Hall's theorem therefore supplies a perfect matching.