Unavoidable Minors of Matroids with Minimum Cocircuit Size Four
Combinatorics
2025-07-15 v1
Abstract
In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has or as a minor. Mills and Turner proved an analog of this theorem by showing that every -connected binary matroid in which every cocircuit has size at least four has or as a minor. Generalizing these results, this paper proves that every simple matroid in which all cocircuits have at least four elements has as a minor one of nine matroids, seven of which are well known. All nine of these special matroids have rank at most five and have at most twelve elements.
Cite
@article{arxiv.2507.09015,
title = {Unavoidable Minors of Matroids with Minimum Cocircuit Size Four},
author = {Matthew Mizell and James Oxley},
journal= {arXiv preprint arXiv:2507.09015},
year = {2025}
}
Comments
35 pages