Towards a splitter theorem for internally 4-connected binary matroids. VI
From MaRDI portal
Abstract: Let be a -connected binary matroid; is called internally -connected if one side of every -separation is a triangle or a triad, and is -connected if one side of every -separation is a triangle, a triad, or a -element fan. Assume is internally -connected and that neither nor its dual is a cubic M"{o}bius or planar ladder or a certain coextension thereof. Let be an internally -connected proper minor of . Our aim is to show that has a proper internally -connected minor with an -minor that can be obtained from either by removing at most four elements, or by removing elements in an easily described way from a special substructure of . When this aim cannot be met, the earlier papers in this series showed that, up to duality, has a good bowtie, that is, a pair, and , of disjoint triangles and a cocircuit, , where has an -minor and is -connected. We also showed that, when has a good bowtie, either has an -minor; or has an -minor and is -connected. In this paper, we show that, when has an -minor but is not -connected, has an internally -connected proper minor with an -minor that can be obtained from by removing at most three elements, or by removing elements in a well-described way from one of several special substructures of . This is a significant step towards obtaining a splitter theorem for the class of internally -connected binary matroids.
Recommendations
- Towards a splitter theorem for internally 4-connected binary matroids. VII
- Towards a splitter theorem for internally 4-connected binary matroids. V
- Towards a splitter theorem for internally 4-connected binary matroids. IV
- Towards a splitter theorem for internally 4-connected binary matroids. III
- Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
Cites work
- A chain theorem for internally 4-connected binary matroids
- A simple theorem on 3-connectivity
- Connectivity in Matroids
- Decomposition of regular matroids
- Generating an internally 4-connected binary matroid from another
- Generating internally four-connected graphs
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
- Towards a splitter theorem for internally 4-connected binary matroids. II
- Towards a splitter theorem for internally 4-connected binary matroids. III
- Towards a splitter theorem for internally 4-connected binary matroids. IV
- Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
- Towards a splitter theorem for internally 4-connected binary matroids. V
Cited in
(11)- Towards a splitter theorem for internally 4-connected binary matroids. II
- The internally 4-connected binary matroids with no \(M(K_{5}\setminus e)\)-minor
- Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
- Towards a splitter theorem for internally 4-connected binary matroids. III
- Towards a splitter theorem for internally 4-connected binary matroids. IV
- Towards a splitter theorem for internally 4-connected binary matroids. V
- Towards a splitter theorem for internally 4-connected binary matroids
- Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
- Towards a splitter theorem for internally 4-connected binary matroids. VII
- A chain theorem for internally 4-connected binary matroids
This page was built for publication: Towards a splitter theorem for internally 4-connected binary matroids. VI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1795490)