Graphs and matrices: A translation of "Graphok \'es matrixok" by D\'enes Konig (1931)
Abstract
This paper, originally written in Hungarian by D\'enes Konig 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 Konig's theorem. The paper also discusses the connection of graphs and matrices, then makes some observations about the combinatorial properties of the latter.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.