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

✍ Scribed by Robert E. Bixby; Arvind Rajan

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 924 KB
Volume: 114-115
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(89)90467-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Short Proof of Seymour's Characterizat

A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property

✍ Bertrand Guenin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Seymour proved that the set of odd circuits of a signed binary matroid ðM; SÞ has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to ðMðK 4 Þ; EðK 4 ÞÞ: We give a shorter proof of this result. # 2002 Elsevier Science (USA)