REVIEW 1 cited by
Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes KH{o}nig (1931)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Graphs and matrices: A translation of "Graphok \'{e}s matrixok" by D\'{e}nes KH{o}nig (1931)
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.
Forward citations
Cited by 1 Pith paper
-
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.