Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
From MaRDI portal
Publication:326807
DOI10.1016/j.jctb.2016.08.001zbMath1348.05048OpenAlexW2517835373MaRDI QIDQ326807
Carolyn Chun, Dillon Mayhew, James G. Oxley
Publication date: 12 October 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2016.08.001
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (3)
Towards a splitter theorem for internally 4-connected binary matroids. VII ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids. ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VI
Cites Work
- Unnamed Item
- 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
- Generating an internally 4-connected binary matroid from another
- Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
- Almost-graphic matroids
- A chain theorem for internally 4-connected binary matroids
- Decomposition of regular matroids
- A simple theorem on 3-connectivity
- A generalization of a graph result of D. W. Hall
- Generating internally four-connected graphs
- The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
- Connectivity in Matroids
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
This page was built for publication: Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.