Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes K\H{o}nig (1931)
History and Overview
2020-09-15 v1 Discrete Mathematics
Combinatorics
Abstract
This paper, originally written in Hungarian by D\'{e}nes K\H{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 K\H{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.
Keywords
Cite
@article{arxiv.2009.03780,
title = {Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes K\H{o}nig (1931)},
author = {Gábor Szárnyas},
journal= {arXiv preprint arXiv:2009.03780},
year = {2020}
}