Minors of asymptotically almost all sparse paving matroids
Will Critchlow

TL;DR
This paper demonstrates that nearly all sparse paving matroids contain certain minors, revealing structural properties common to almost all such matroids through counting arguments.
Contribution
It establishes that asymptotically almost all sparse paving matroids contain minors from specific classes, extending to larger classes under fixed rank restrictions.
Findings
Nearly all sparse paving matroids contain specific minors.
The result applies to larger classes of minors for fixed rank.
Counting arguments underpin the proof.
Abstract
We use counting arguments to show that asymptotically almost all sparse paving matroids contain an -minor, where falls into one of several simple classes of matroids. Furthermore the result holds for all in a larger class of matroids, if we restrict to asymptotically almost all sparse paving matroids of fixed rank (where is necessarily no smaller than the rank of ).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
