Unavoidable Minors of Matroids with Minimum Cocircuit Size Four

In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which every cocircuit has size at least four has $F_7, M^*(K_{3,3}), M(K_5),$ or $ M(K_{2,2,2})$ 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.

Authors

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2026-10-09
DOI
https://doi.org/10.37236/14364
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Unavoidable Minors of Matroids with Minimum Cocircuit Size Four

JAMES G. OXLEY, Matthew Mizell
The Electronic Journal of Combinatorics
Advanced Graph Theory Research
article

Unavoidable Minors of Matroids with Minimum Cocircuit Size Four

JAMES G. OXLEY, Matthew Mizell
article en

Abstract

In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which every cocircuit has size at least four has $F_7, M^*(K_{3,3}), M(K_5),$ or $ M(K_{2,2,2})$ 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.

The Electronic Journal of CombinatoricsVol. 33(4)
Openalex Percentile: Top 97%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Unavoidable Minors of Matroids with Minimum Cocircuit Size Four — JAMES G. OXLEY, Matthew Mizell · The Electronic Journal of Combinatorics (2026) | TGRS Research Map | TGRS