2020/09/05 by Gábor Szárnyas, Szárnyas, Gábor · 1 citation
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #History and Overview (math.HO) #cs.DM #math.CO #math.HO
paper · pdf · doi:10.48550/arxiv.2009.03780
arxiv created 2020/09/05 · arxiv updated 2020/09/15
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.