Guichard-Combinatorics-Graph-Theory · Problem 5.4.4
Graph Theory
Mathematics — Probability · bipartite-graphs
Problem
A perfect matching is one in which all vertices of the graph are incident with exactly one edge in the matching. Show that a regular bipartite graph with common degree at least 1 has a perfect matching. (We discussed matchings in section 4.5.)