Strong splitter theorem

DOI10.1007/S00026-013-0214-5zbMATH Open1360.05028arXiv1201.4427OpenAlexW2142728611MaRDI QIDQ404393FDOQ404393

Publication date: 4 September 2014

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: The Splitter Theorem states that, if

N

is a 3-connected proper minor of a 3-connected matroid

M

such that, if

N

is a wheel or whirl then

M

has no larger wheel or whirl, respectively, then there is a sequence

M_{0}, ..., M_{n}

of 3-connected matroids with

M_{0} c o n g N

,

M_{n} = M

and for

i i n 1, ..., n

,

M_{i}

is a single-element extension or coextension of

M_{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,

M

starting with

N

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)

). Moreover, if two consecutive single-element extensions by elements

e, f

are followed by a coextension by element

g

, then

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