[Paper Review] Strong Splitter Theorem

S. R. Kingan, Manoel Lemos|Jan 21, 2012

graph theory and CDMA systems4 references4 citations

TL;DR

This paper introduces the Strong Splitter Theorem, a refinement of the classical Splitter Theorem in matroid theory, which guarantees a sequence of 3-connected single-element extensions or coextensions from a minor $N$ to a 3-connected matroid $M$, with at most two consecutive extensions before a coextension. The key contribution is a structural constraint: if two extensions are followed by a coextension, the three elements form a triad. This result enables a complete classification of binary almost-regular matroids with an $E_5$-minor but no $E_4$-minor, showing they are isomorphic to $E_5$, $B$, $B^*$, $X_{12}$, or restrictions of $S_{3n+1}$, $\mathcal{F}_1$, or $\mathcal{F}_2$. The theorem strengthens the analysis of matroid minors and regularity properties.

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\cong N$, $M_n=M$ and for $i\in \{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 $e$, either $M\backslash e$ 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 $M\backslash e$ 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.

Motivation & Objective

• To strengthen the classical Splitter Theorem by imposing structural constraints on the sequence of extensions and coextensions used to build a 3-connected matroid from a minor.
• To classify binary almost-regular matroids that have an $E_5$-minor but no $E_4$-minor, resolving a problem in matroid regularity theory.
• To determine the complete set of such matroids, showing they are limited to specific known classes or small exceptional cases.
• To prove that $M_{12}$ is a splitter for the class of binary matroids with an $E_5$-minor but no $E_4$-minor, using the new structural constraints.

Proposed method

• Develop a refined version of the Splitter Theorem that limits sequences of single-element extensions to at most two consecutive steps before a coextension.
• Introduce a triad condition: if two extensions are followed by a coextension, the three elements involved form a triad in the resulting matroid.
• Use the Strong Splitter Theorem to analyze single-element extensions and coextensions of $E_5$, restricting to matroids without $E_4$-minors.
• Construct and classify all such extensions and coextensions by analyzing column additions to the matrix representation of $E_5$, using row and column operations.
• Prove that the only 3-connected binary matroids with an $E_5$-minor but no $E_4$-minor are $E_5$, $B$, $B^*$, $X_{12}$, or restrictions of $S_{3n+1}$, $\mathcal{F}_1$, or $\mathcal{F}_2$.
• Verify that no further extensions beyond $M_{12}$ exist without introducing an $E_4$-minor, confirming $M_{12}$ as a splitter.

Experimental results

Research questions

• RQ1 Can the classical Splitter Theorem be strengthened to control the sequence of extensions and coextensions in terms of consecutive extensions?
• RQ2 What is the complete set of 3-connected binary almost-regular matroids with an $E_5$-minor but no $E_4$-minor?
• RQ3 Is $M_{12}$ a splitter for the class of binary matroids with an $E_5$-minor but no $E_4$-minor?
• RQ4 What structural constraints arise when two consecutive extensions are followed by a coextension in a 3-connected matroid sequence?
• RQ5 Which matroids arise as 3-connected restrictions of $S_{3n+1}$, $\mathcal{F}_1$, or $\mathcal{F}_2$ in the context of almost-regularity and minor avoidance?

Key findings

• The Strong Splitter Theorem ensures that any 3-connected matroid $M$ can be built from a minor $N$ via a sequence of 3-connected single-element extensions or coextensions, with at most two consecutive extensions before a coextension.
• If two consecutive extensions are followed by a coextension, the three elements involved form a triad in the resulting matroid.
• The only 3-connected binary matroids with an $E_5$-minor but no $E_4$-minor are $E_5$, $B$, $B^*$, $X_{12}$, or restrictions of $S_{3n+1}$, $\mathcal{F}_1$, or $\mathcal{F}_2$ for $n \geq 3$, $m,n,r \geq 1$.
• The matroid $M_{12}$ is a splitter for the class of binary matroids with an $E_5$-minor but no $E_4$-minor, as no further coextensions exist without introducing an $E_4$-minor.
• No 3-connected binary almost-regular matroid with an $E_5$-minor and no $E_4$-minor exists beyond $E_5$, $B$, $B^*$, $X_{12}$, or the specified families, confirming the classification.
• The matroid $H$, which has an $E_4$-minor, is a necessary minor for any almost-regular matroid with an $E_5$-minor beyond the exceptional cases, implying that $H$-minor presence is unavoidable in such extensions.