Category
Level
KΓΆnig's Theorem states that in any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover.