Kőnig's theorem (graph theory)
On bipartite matching and vertex cover
Kőnig's theorem (graph theory)
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. It was discovered independently, also in 1931, by Jenő Egerváry in the more general case of weighted graphs.
Read on Wikipedia · Image David Eppstein, Public domain
Open boosters, collect cards and trade them. Free to play.
Play for free