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.

中文翻译：

---

图和矩阵：D\'{e}nes K\H{o}nig (1931) 对“Graphok \'{e}s matrixok”的翻译

这篇论文最初由 D\'{e}nes K\H{o}nig 于 1931 年用匈牙利语写成，证明了在二部图中，最小顶点覆盖和最大匹配具有相同的大小。这个陈述现在被称为 K\H{o}nig 定理。论文还讨论了图和矩阵的联系，然后对后者的组合性质进行了一些观察。