koenigs_theorem (263B)
1 # König's theorem 2 3 In a [graph_bipartite], the [maximum_matching] size and the [minimum_vertex_cover] size are the same. 4 5 There is also a weighted version: Egerváry's theorem 6 7 Generalization to [hypergraph] if they are [hypergraph_balanced] 8 9 Up: [vertex_cover]