An Obstacle to a Decomposition Theorem for Near-Regular Matroids

DOI10.1137/090759616MaRDI QIDQ3094912zbMATH OpenOpenAlexFDO

Authors Dillon Mayhew, Stefan H. M. van Zwam, Geoff Whittle

Publication date 27 October 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.3252

zbMATH Keywords

decompositionpartial fields

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obtained from matroids that belong to a few basic classes through k-sums. Also suppose that these basic classes are such that, whenever a class contains all graphic matroids, it does not contain all cographic matroids. We show that in that case 3-sums will not suffice.

Recommendations

• A decomposition theory for matroids. VI: Almost regular matroids
• Obstructions to branch-decomposition of matroids
• scientific article; zbMATH DE number 3885921
• A decomposition theory for matroids. I: General results
• On the impossibility of decomposing binary matroids
• Obstacles to decomposition theorems for sixth-root-of-unity matroids
• scientific article; zbMATH DE number 3970768
• A decomposition theory for matroids. III. Decomposition conditions
• A decomposition theorem for binary matroids with no prism minor
• A decomposition theory for matroids. IV: Decomposition of graphs

Cited in

(12)

• On perturbations of highly connected dyadic matroids
• Binary signed-graphic matroids: representations and recognition algorithms
• The templates for some classes of quaternary matroids
• Matroid 3-connectivity and branch width
• Obstacles to decomposition theorems for sixth-root-of-unity matroids
• On regular matroids without certain minors
• Bicircular signed-graphic matroids
• On characterizing the class of cographic signed-graphic matroids
• Obstructions to weak decomposability for simplicial polytopes
• On the highly connected dyadic, near-regular, and sixth-root-of-unity matroids
• Decomposition of quaternary signed-graphic matroids
• A mathematical programming approach for recognizing binet matrices

This page was built for publication: An Obstacle to a Decomposition Theorem for Near-Regular Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094912)