Strong splitter theorem

. 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

e

, either

or

M / e

is regular.} In [4] we determined the binary almost-regular matroids with at least one regular element (an element such that both

and

M / e

is regular) by characterizing the class of binary almost-regular matroids with no minor isomorphic to one particular matroid that we called

E_{5}

. As a consequence of the Strong Splitter Theorem we can determine the class of binary matroids with an

E_{5}

-minor, but no

E_{4}

-minor.

Review text

The splitter theorem [\textit{P. D. Seymour}, J. Comb. Theory, Ser. B. 28, 305--359 (1980; Zbl 0443.05027)] is one of the main tools employed by matroid theorists to set up proofs by induction. It shows that, if \(M\) is a 3-connected matroid with a 3-connected minor \(N\), then we can find some element of \(M\) whose deletion or contraction is again 3-connected with a minor isomorphic to \(N\), with a few exceptions. The exceptions relate to two special families of matroids, the wheels and whirls. Repeatedly applying this result yields a sequence \(M_0, M_1, \ldots, M_k\) of 3-connected matroids, with \(M_0\) isomorphic to \(N\), with \(M_k = M\), and with \(M_{i-1}\) obtained from \(M_i\) by a single-element deletion or contraction. The authors of the present paper prove the existence of a similar sequence \(M_0, \ldots, M_m, M_{m+1}, \ldots, M_k\) of 3-connected matroids with \(M_0\) isomorphic to \(N\), with \(M_k\) isomorphic to \(M\), with \(m = r(M) - r(N)\), such that \(M_{i-1}\) is a minor of \(M_i\), and for \(i \in \{1, \ldots, m\}\), \(r(M_i) - r(M_{i-1}) = 1\) and \(|E(M_i) - E(M_{i-1})| \leq 3\), whereas for \(i \in \{m+1, \ldots, k\}\), \(r(M_i) = r(M_k)\) and \(|E(M_i) - E(M_{i-1})| = 1\). In other words, one can ensure the rank increases by 1 in each of the initial steps, at the potential cost of increasing the size by up to 3 elements. They characterize the 3-element move exactly. Moreover, the authors use the result to characterize a certain subclass of the almost-regular matroids.

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Strong splitter theorem

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