Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes K\H{o}nig (1931)
From MaRDI portal
Publication:6348682
Abstract: This paper, originally written in Hungarian by D'{e}nes KH{o}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 KH{o}nig's theorem. The paper also discusses the connection of graphs and matrices, then makes some observations about the combinatorial properties of the latter.
This page was built for publication: Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes K\H{o}nig (1931)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348682)
