Regular bipartite graph has a perfect matching
ID: regular-bipartite-graph-has-a-perfect-matching
In a finite bipartite graph that is -regular graph with , edge counting gives equal vertex-class sizes and . Hall's theorem therefore supplies a perfect matching.
New to topics? Read the docs here!