arXiv · 2610.11829
A rank bound for bases and circuits in binary matroids
Abstract
Let \(b(M)\), \(d(M)\), and \(r(M)\) denote the number of bases, the number of circuits, and the rank of a matroid \(M\), respectively. Using a weighted count of fundamental circuits, we prove that every nonempty simple binary matroid \(M\) with no coloops satisfies \[ 2b(M)\ge(r(M)+1)d(M), \] with equality if and only if \(M\) is isomorphic to the Fano matroid. This settles a conjecture recorded by Oxley in 1983. For every \(e\in E(M)\), we also establish the deletion bound \(b(M\backslash e)\ge d(M)\) and characterize its equality cases. The deletion bound yields a sharp linear lower bound for basis growth under successive series extensions. Finally, under a circuit-size exclusion condition, every pair \((C,e)\) with \(C\) a circuit of a prescribed size and \(e\in C\) can be assigned a distinct basis containing \(C-e\).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Houshan Fu. 2026-10-31. A rank bound for bases and circuits in binary matroids. https://searcharxiv.com/abs/2610.11829
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.