An Obstacle to a Decomposition Theorem for Near-Regular Matroids

Seymour's decomposition theorem [J. Combin. Theory Ser. B, 28 (1980), pp. 305-359] for regular matroids states that any matroid representable over both $\mathrm{GF}(2)$ and $\mathrm{GF}(3)$ can be obtained from matroids that are graphic, cographic, or isomorphic to $R_{10}$ 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.

[1]  James G. Oxley,et al.  Matroid theory , 1992 .

[2]  Klaus Truemper,et al.  On the Efficiency of Representability Tests for Matroids , 1982, Eur. J. Comb..

[3]  Geoff Whittle,et al.  On Maximum-Sized Near-Regular and -Matroids , 1998, Graphs Comb..

[4]  Thomas Zaslavsky.  Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74 , 1983, Discret. Appl. Math..

[5]  H. P. Williams.  THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .

[6]  Dillon Mayhew,et al.  The excluded minors for near-regular matroids , 2009, Eur. J. Comb..

[7]  J. Geelen,et al.  TOWARDS A MATROID-MINOR STRUCTURE THEORY , 2007 .

[8]  Geoff Whittle,et al.  A Characterization of the Matroids Representable over GF(3) and the Rationals , 1995, J. Comb. Theory, Ser. B.

[9]  Charles Semple,et al.  Partial Fields and Matroid Representation , 1996 .

[10]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[11]  Petr Hlinen,et al.  USING A COMPUTER IN MATROID THEORY RESEARCH , 2004 .

[12]  Rudi Pendavingh,et al.  Confinement of matroid representations to subsets of partial fields , 2008, J. Comb. Theory, Ser. B.

[13]  Paul D. Seymour,et al.  Recognizing graphic matroids , 1981 .

[14]  V. Rich.  Personal communication , 1989, Nature.

[15]  S.H.M. vanZwam.  Partial fields in matroid theory , 2009 .

[16]  Tom Brylawski,et al.  Modular constructions for combinatorial geometries , 1975 .

[17]  B. M. Fulk.  MATH , 1992 .

[18]  Rudi Pendavingh,et al.  Lifts of matroid representations over partial fields , 2008, J. Comb. Theory, Ser. B.

[19]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[20]  WellingtonNew ZealandE.  On matroids representable over GF(3) and other fields , 1997 .

[21]  Thomas A. Dowling,et al.  A class of geometric lattices based on finite groups , 1973 .

[22]  Jon Lee,et al.  The incidence structure of subspaces with well-scaled frames , 1990, J. Comb. Theory, Ser. B.

[23]  D. Vertigan,et al.  On Maximum-Sized Near-Regular and 16 p-Matroids , 1998 .

[24]  Geoff Whittle,et al.  Recent work in matroid representation theory , 2005, Discret. Math..