Kőnig's theorem (graph theory)
= Kőnig's theorem
{disambiguate=graph theory}
{c}
{wiki}
= Kőnig's theorem for bipartite matching
{c}
{synonym}
In a finite bipartite graph, the maximum size of a matching equals the minimum size of a vertex cover. It follows by representing matching as an integral flow and vertex covers as finite-capacity cuts.