On the public citation graph

A proof of Menger's theorem

0 signed · 17 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02759805openalex-snapshot

A proof of dilworth’s decomposition theorem for partially ordered sets

inferredcites →https://doi.org/10.1112/s0025579300004162openalex-snapshot

Short proof of Menger's graph theorem

inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot

Zur allgemeinen Kurventheorie

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.3190080311openalex-snapshot

A simple proof of Menger's theorem

inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_68openalex-snapshot

Feasible Combinatorial Matrix Theory

inferred← citeshttps://doi.org/10.1007/bf00354897openalex-snapshot

The Menger property for infinite ordered sets

inferred← citeshttps://doi.org/10.1007/s00373-023-02657-5openalex-snapshot

Minimum Separators and Menger’s Theorem

inferred← citeshttps://doi.org/10.1016/0022-247x(70)90180-0openalex-snapshot

Submodular functions and independence structures

inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00088-1openalex-snapshot

Short proof of Menger's Theorem

inferred← citeshttps://doi.org/10.1016/s0076-5392(08)63140-9openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1112/jlms/s2-4.1.46openalex-snapshot

Menger's Theorem and Matroids

inferred← citeshttps://doi.org/10.2307/3616639openalex-snapshot

Inductio ad absurdum?

inferred← citeshttps://doi.org/10.2307/3616640openalex-snapshot

Symbols, and how scientists use them

inferred← citeshttps://doi.org/10.4467/20842589rm.22.003.16660openalex-snapshot

A formal approach to Menger's theorem

inferred← citeshttps://doi.org/10.70675/c4a3625ez4d6cz4345z9ab8zb6e0442837b3openalex-snapshot

Minimal separators for graphs and paths in digraphs

inferred← citeshttps://doi.org/10.7151/dmgt.1161openalex-snapshot

A proof of Menger's Theorem by contraction

inferred← citeshttps://doi.org/10.71548/19049openalex-snapshot

Formalizing Combinatorial Matrix Theory

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.