arXiv Analytics

Sign in

arXiv:1501.00327 [math.CO]AbstractReferencesReviewsResources

A splitter theorem for internally 4-connected binary matroids: small matroids

Carolyn Chun, Dillon Mayhew, James Oxley

Published 2015-01-01Version 1

Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (N,M), where N and M are internally 4-connected binary matroids, M has a proper N-minor and there is no internally 4-connected matroid that lies strictly between N and M in the minor-order on binary matroids. The analysis in the splitter theorem requires the constraint that |E(M)|>15. In this technical report, we complement that analysis by using an exhaustive search to find all such pairs satisfying 5 < |E(N)| < |E(M)|-3 < |E(M)| < 16.

Related articles: Most relevant | Search more
arXiv:1405.6454 [math.CO] (Published 2014-05-26, updated 2014-11-07)
A splitter theorem on 3-connected matroids and graphs
arXiv:1608.01027 [math.CO] (Published 2016-08-02)
Towards a Splitter Theorem for Internally $4$-connected Binary Matroids VII
arXiv:1608.01022 [math.CO] (Published 2016-08-02)
Towards a Splitter Theorem for Internally $4$-connected Binary Matroids VI