Mayhew Royle Whittle 2017 Excluding Kuratowski graphs and their duals from binary matroids.pdf (325.19 kB)
0/0

Excluding Kuratowski graphs and their duals from binary matroids

Download (325.19 kB)
journal contribution
posted on 25.03.2020 by Dillon Mayhew, G Royle, Geoffrey Whittle
© 2017 Elsevier Inc. 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 M, where M is a 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 M. 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.

History

Preferred citation

Mayhew, D., Royle, G. & Whittle, G. (2017). Excluding Kuratowski graphs and their duals from binary matroids. Journal of Combinatorial Theory: Series B, 125, 95-113. https://doi.org/10.1016/j.jctb.2017.03.005

Journal title

Journal of Combinatorial Theory. Series B

Volume

125

Publication date

01/07/2017

Pagination

95-113

Publisher

Elsevier BV

Publication status

Published

ISSN

0095-8956

eISSN

1096-0902

Language

en

Exports