20 citations · 28 across the 5 of their papers we have counts for
1 paper · 1 filter
Gábor Szárnyas
This paper, originally written in Hungarian by Dénes Kőnig in 1931, proves that in a bipartite graph, the minimum vertex cover and the maximum matching have the same size. This sta…