Short proof of Menger's theorem

DOI10.1016/S0012-365X(00)00088-1zbMath0959.05070OpenAlexW2039365410MaRDI QIDQ1567687

Frank Göring

Publication date: 21 June 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00088-1

zbMATH Keywords

digraphstheorem of Menger

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (5)

On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds ⋮ Minimum separators and Menger's theorem ⋮ Graph theory in Coq: minors, treewidth, and isomorphisms ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Dichromatic number and forced subdivisions

This page was built for publication: Short proof of Menger's theorem