pith. sign in

arxiv: 0902.0198 · v3 · pith:Y4O6GLJRnew · submitted 2009-02-02 · 🧮 math.CO

Excluding Kuratowski graphs and their duals from binary matroids

classification 🧮 math.CO
keywords binaryminormatroidscharacteriseconnectedinternallymatroidsome
0
0 comments X
read the original abstract

We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of {M(K3,3),M*(K3,3),M(K5),M*(K5)} that contains either M(K3,3) or M*(K3,3). We also describe a practical algorithm for testing whether a binary matroid has a minor in the subset. In addition we characterise the growth-rate of binary matroids with no M(K3,3)-minor, and we show that a binary matroid with no M(K3,3)-minor has critical exponent over GF(2) at most equal to four.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.