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

Date
1986-11
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

This 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.

Description
Advisor
Degree
Type
Technical report
Keywords
Citation

Bixby, Robert E. and Rajan, Arvind. "A Short Proof of a Decomposition Theorem for Max-Flow Min-Cut Matroids." (1986) https://hdl.handle.net/1911/101610.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page