A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids

DOI10.1016/0024-3795(89)90467-9zbMath0679.05015OpenAlexW1982443027MaRDI QIDQ1124594

Arvind Rajan, Robert E. Bixby

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/101632

zbMATH Keywords

max-flow min-cut propertymatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• A decomposition theory for matroids. I: General results
• A decomposition theory for matroids. III. Decomposition conditions
• Decomposition of regular matroids
• The matroids with the max-flow min-cut property
• A note on the production of matroid minors
• A decomposition of the matroids with the max-flow min-cut property
• Partial matroid representations
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Lectures on matroids

This page was built for publication: A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids