A decomposition theory for matroids. III. Decomposition conditions

DOI10.1016/0095-8956(86)90052-3zbMath0608.05021OpenAlexW2162113336MaRDI QIDQ1086242

Klaus Truemper

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90052-3

zbMATH Keywords

minormatroid decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A decomposition theory for matroids. IV: Decomposition of graphs, Confinement of matroid representations to subsets of partial fields, A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids, Stability, fragility, and Rota's conjecture, Rooted prism-minors and disjoint cycles containing a specified edge, Triangles in 3-connected matroids, The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor., The excluded minors for near-regular matroids, A decomposition of the matroids with the max-flow min-cut property, A note on nongraphic matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theory for matroids. I: General results
• A decomposition theory for matroids. II. Minimal violation matroids
• Decomposition of regular matroids
• The matroids with the max-flow min-cut property
• A decomposition of the matroids with the max-flow min-cut property
• On the efficiency of representability tests for matroids
• Partial matroid representations
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes