No coordinates found
Kőnig's theorem (graph theory)
Theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphsIn the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig, 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 article
|File:Koenigs-theorem-graph.svg)
|File:Minimum_cut_in_a_bipartite_graph.svg)
Top Questions
AI generatedMore questions