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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
