Towards a splitter theorem for internally 4-connected binary matroids

This is the post-print version of the Article - Copyright @ 2012 ElsevierWe prove that if M is a 4-connected binary matroid and N is an internally 4-connected proper minor of M with at least 7 elements, then, unless M is a certain 16-element matroid, there is an element e of E(M) such that either M\e or M/e is internally 4-connected having an N-minor. This strengthens a result of Zhou and is a first step towards obtaining a splitter theorem for internally 4-connected binary matroids.This study is partially funded by Marsden Fund of New Zealand and the National Security Agency

Towards a splitter theorem for internally 4-connected binary matroids VIII: small matroids

Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (M,N), where N and M are internally 4-connected binary matroids, M has a proper N-minor, and if M' is an internally 4-connected matroid such that M has a proper M'-minor and M' has an N-minor, then |E(M)|-|E(M')|>3. The analysis in the splitter theorem requires the constraint that |E(M)|>15. In this article, we complement that analysis by using an exhaustive computer search to find all such pairs satisfying |E(M)|<16.Comment: Correcting minor error

Towards a splitter theorem for internally 4-connected binary matroids VI

Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-separation is a triangle or a triad, and M is internally 4-connected if one side of every 3-separation is a triangle, a triad, or a 4-element fan. Assume M is internally 4-connected and that neither M nor its dual is a cubic Möbius or planar ladder or a certain coextension thereof. Let N be an internally 4-connected proper minor of M. Our aim is to show that M has a proper internally 4-connected minor with an N-minor that can be obtained from M either by removing at most four elements, or by removing elements in an easily described way from a special substructure of M. When this aim cannot be met, the earlier papers in this series showed that, up to duality, M has a good bowtie, that is, a pair, {x1,x2,x3} and {x4,x5,x6}, of disjoint triangles and a cocircuit, {x2,x3,x4,x5}, where M\x3 has an N-minor and is internally 4-connected. We also showed that, when M has a good bowtie, either M\x3,x6 has an N-minor; or M\x3/x2 has an N-minor and is internally 4-connected. In this paper, we show that, when M\x3,x6 has an N-minor but is not internally 4-connected, M has an internally 4-connected proper minor with an N-minor that can be obtained from M by removing at most three elements, or by removing elements in a well-described way from one of several special substructures of M. This is a significant step towards obtaining a splitter theorem for the class of internally 4-connected binary matroids

Towards a splitter theorem for internally 4-connected binary matroids IX: The theorem

Let M be a binary matroid that is internally 4-connected, that is, M is 3-connected, and one side of every 3-separation is a triangle or a triad. Let N be an internally 4-connected proper minor of M. In this paper, we show that M has a proper internally 4-connected minor with an N-minor that can be obtained from M either by removing at most three elements, or by removing some set of elements in an easily described way from one of a small collection of special substructures of M

Excluding Kuratowski graphs and their duals from binary matroids

We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of {M(K3,3),M*(K3,3),M(K5),M*(K5)} that contains either M(K3,3) or M*(K3,3). We also describe a practical algorithm for testing whether a binary matroid has a minor in the subset. In addition we characterise the growth-rate of binary matroids with no M(K3,3)-minor, and we show that a binary matroid with no M(K3,3)-minor has critical exponent over GF(2) at most equal to four.Comment: Some small change

A chain theorem for internally 4-connected binary matroids

This is the post-print version of the Article - Copyright @ 2011 ElsevierLet M be a matroid. When M is 3-connected, Tutte’s Wheels-and-Whirls Theorem proves that M has a 3-connected proper minor N with |E(M) − E(N)| = 1 unless M is a wheel or a whirl. This paper establishes a corresponding result for internally 4-connected binary matroids. In particular, we prove that if M is such a matroid, then M has an internally 4-connected proper minor N with |E(M) − E(N)| at most 3 unless M or its dual is the cycle matroid of a planar or Möbius quartic ladder, or a 16-element variant of such a planar ladder.This study was partially supported by the National Security Agency

The excluded minors for the class of matroids that are binary or ternary

We show that the excluded minors for the class of matroids that are binary or ternary are U2,5, U3,5, U2,4position indicatorF7, U2,4position indicatorF7*, U2,4position indicator2F7, U2,4position indicator2F7*, and the unique matroids obtained by relaxing a circuit-hyperplane in either AG(3,2) or T12. The proof makes essential use of results obtained by Truemper on the structure of almost-regular matroids. © 2011 Elsevier Ltd

Internally 4-Connected Binary Matroids with Every Element in Three Triangles

Let M be an internally 4-connected binary matroid with every element in exactly three triangles. Then M has at least four elements e such that si(M/e) is internally 4-connected. This technical result is a crucial ingredient in Abdi and Guenin’s theorem determining the minimally non-ideal binary clutters that have a triangle