English

Strong Splitter Theorem

Combinatorics 2015-09-15 v1

Abstract

The Splitter Theorem states that, if NN is a 3-connected proper minor of a 3-connected matroid MM such that, if NN is a wheel or whirl then MM has no larger wheel or whirl, respectively, then there is a sequence M0,...,MnM_0,..., M_n of 3-connected matroids with M0NM_0\cong N, Mn=MM_n=M and for i{1,...,n}i\in \{1,..., n\}, MiM_i is a single-element extension or coextension of Mi1M_{i-1}. Observe that there is no condition on how many extensions may occur before a coextension must occur. In this paper, we give a strengthening of the Splitter Theorem, as a result of which we can obtain, up to isomorphism, MM starting with NN and at each step doing a 3-connected single-element extension or coextension, such that at most two consecutive single-element extensions occur in the sequence (unless the rank of the matroids involved are r(M)r(M)). Moreover, if two consecutive single-element extensions by elements {e,f}\{e, f\} are followed by a coextension by element gg, then {e,f,g}\{e, f, g\} form a triad in the resulting matroid. Using the Strong Splitter Theorem, we make progress toward the problem of determining the almost-regular matroids [6, 15.9.8]. {\it Find all 3-connected non-regular matroids such that, for all ee, either M\eM\backslash e or M/eM/e is regular.} In [4] we determined the binary almost-regular matroids with at least one regular element (an element such that both M\eM\backslash e and M/eM/e is regular) by characterizing the class of binary almost-regular matroids with no minor isomorphic to one particular matroid that we called E5E_5. As a consequence of the Strong Splitter Theorem we can determine the class of binary matroids with an E5E_5-minor, but no E4E_4-minor.

Keywords

Cite

@article{arxiv.1201.4427,
  title  = {Strong Splitter Theorem},
  author = {S. R. Kingan and Manoel Lemos},
  journal= {arXiv preprint arXiv:1201.4427},
  year   = {2015}
}
R2 v1 2026-06-21T20:07:49.516Z