论文标题
图形和矩阵：DénesKőnig（1931）的“ graphokésmatrixok”的翻译
Graphs and matrices: A translation of "Graphok és matrixok" by Dénes Kőnig (1931)
论文作者
论文摘要
本文最初由DénesKőnig于1931年用匈牙利语撰写，证明了在两部分图中，最小顶点盖和最大匹配的大小相同。现在，该陈述被称为kőnig的定理。本文还讨论了图和矩阵的连接，然后对后者的组合特性进行了一些观察。
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.
