koenigs_theorem (348B)
1 # König's theorem 2 3 https://en.wikipedia.org/wiki/K%C5%91nig%27s_theorem_(graph_theory) 4 5 In a [bipartite_graph], the [maximum_matching] size and the [minimum_vertex_cover] size are the same. 6 7 There is also a weighted version: [Egerváry's_theorem] 8 9 Generalization to [hypergraphs] if they are [hypergraph_balanced] 10 11 Up: [theorem] on [vertex_cover]