2015/01/01 by Carolyn Chun, Chun, Carolyn, Dillon Mayhew +3
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs
paper · pdf · doi:10.48550/arxiv.1501.00327
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.