Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

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

Gábor Szárnyas This is my paper · ORCID
classification math.HOcs.DMmath.CO
keywords graphsmatricesbipartitecombinatorialconnectioncoverdiscussesgraph
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU

    cs.DC 2019-08 conditional novelty 6.0 of 10

    GraphBLAST shows that sparse linear algebra with automatic push-pull switching, output masking, and load balancing can make a GraphBLAS-compliant GPU framework competitive with hand-tuned graph frameworks.

Pith tools