2012/06/20 by Carolyn Chun, Chun, Carolyn, Dillon Mayhew +3
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1206.4731
arxiv created 2012/06/20 · openalex publication_date 2012/06/20 · arxiv updated 2012/06/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E(N)| is at least seven. As part of our project to develop a splitter theorem for internally 4-connected binary matroids, we prove the following result: if M\e has no N-minor whenever e is in a triangle of M, and M/e has no N-minor whenever e is in a triad of M, then M has a minor, M', such that M' is internally 4-connected with an N-minor, and 0 < |E(M)|-|E(M')| < 3.