König's theorem
Sign in to saveAlso known as König–Hall theorem, König–Egerváry theorem
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs
Also known as König–Hall theorem, König–Egerváry theorem
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs