A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
From MaRDI portal
Publication:1403921
DOI10.1006/jctb.2002.2127zbMath1023.05029OpenAlexW2064861714MaRDI QIDQ1403921
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d21475d69ac3316e7fe704254ede4b0c4f485d56
Related Items (3)
Cuboids, a class of clutters ⋮ Ranking tournaments with no errors. II: Minimax relation ⋮ Ranking tournaments with no errors. I: Structural description
Cites Work
This page was built for publication: A short proof of Seymour's characterization of the matroids with the max-flow min-cut property