A Short Proof of a Decomposition Theorem for Max-Flow Min-Cut Matroids

Simple item page
dc.contributor.authorBixby, Robert E.
dc.contributor.authorRajan, Arvind
dc.date.accessioned2018-06-18T17:27:12Z
dc.date.available2018-06-18T17:27:12Z
dc.date.issued1986-11
dc.date.noteNovember 1986
dc.description.abstractThis report contains short proofs of two known matroid decomposition results, both of which are based on a decomposition algorithm of Truemper. The main result is a recent theorem of Truemper and Tseng for the class of matroids with the max-flow min-cut property, a class characterized by Seymour. The theorem says essentially that every matroid in this class is either isomorphic to F tau or is decomposable into a 3-sum in a well-defined way. The second result describes the structure of regular matroids, and is an important ingredient in Seymour's decomposition theorem for this class.
dc.format.extent18 pp
dc.identifier.citationBixby, Robert E. and Rajan, Arvind. "A Short Proof of a Decomposition Theorem for Max-Flow Min-Cut Matroids." (1986) <a href="https://hdl.handle.net/1911/101610">https://hdl.handle.net/1911/101610</a>.
dc.identifier.digitalTR86-24
dc.identifier.urihttps://hdl.handle.net/1911/101610
dc.language.isoeng
dc.titleA Short Proof of a Decomposition Theorem for Max-Flow Min-Cut Matroids
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR86-24.pdf
Size:
244.41 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports