A short proof of Mader's \(\mathcal S\)-paths theorem

DOI10.1006/jctb.2000.2029zbMath1027.05051OpenAlexW2000065147MaRDI QIDQ1850551

No author found.

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.2029

zbMATH Keywords

min-max theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (15)

Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Finding Maximum Edge-Disjoint Paths Between Multiple Terminals ⋮ Optimal connectivity for fat-triangle linkages ⋮ A randomized polynomial kernel for subset feedback vertex set ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ DisjointT-paths in tough graphs ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ Packing non-zero \(A\)-paths in an undirected model of group labeled graphs ⋮ A fast algorithm for the path 2-packing problem ⋮ Disjoint non-balanced \(A\)-paths in biased graphs ⋮ On the complexity of finding internally vertex-disjoint long directed paths ⋮ Disjoint \(A\)-paths in digraphs ⋮ Euler Digraphs ⋮ Packings and 2-packings of A-paths

Cites Work

• Unnamed Item
• Matroid matching and some applications
• Über die Maximalzahl kreuzungsfreier H-Wege
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• The Factorization of Linear Graphs

This page was built for publication: A short proof of Mader's \(\mathcal S\)-paths theorem