The reviewed record of science sign in
Pith

arxiv: 2009.03780 · v1 · pith:7ZRHRCJR · submitted 2020-09-05 · math.HO · cs.DM· math.CO

Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes KH{o}nig (1931)

G\'abor Sz\'arnyas This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7ZRHRCJRrecord.jsonopen to challenge →

classification math.HO cs.DMmath.CO
keywords graphsmatricesbipartitecombinatorialconnectioncoverdiscussesgraph
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States

    quant-ph 2026-03 unverdicted novelty 6.0

    BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.