1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Jacob Turner
It is a celebrated result in early combinatorics that, in bipartite graphs, the size of maximum matching is equal to the size of a minimum vertex cover. Kőnig's proof of this fact…