Unavoidable Minors of Matroids with Minimum Cocircuit Size Four
Matthew Mizell, James Oxley
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.