arXiv · 2009.03780
Graphs and matrices: A translation of "Graphok és matrixok" by Dénes Kőnig (1931)
Abstract
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 statement is now known as Kőnig's theorem. The paper also discusses the connection of graphs and matrices, then makes some observations about the combinatorial properties of the latter.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gábor Szárnyas. 2020-09-05. Graphs and matrices: A translation of "Graphok és matrixok" by Dénes Kőnig (1931). https://arxiv.org/abs/2009.03780
Cite the original work for its findings. Save a collection to share your selection of sources.