Excluding Kuratowski graphs and their duals from binary matroids

From MaRDI portal
Publication:2396894

DOI10.1016/J.JCTB.2017.03.005zbMATH Open1362.05032arXiv0902.0198OpenAlexW1549542520MaRDI QIDQ2396894FDOQ2396894


Authors: Dillon Mayhew, Gordon Royle, Geoff Whittle Edit this on Wikidata


Publication date: 26 May 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0902.0198




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Excluding Kuratowski graphs and their duals from binary matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396894)