Projective geometries in exponentially dense matroids. I
Jim Geelen, Peter Nelson

TL;DR
This paper characterizes the maximum density of certain minor-closed classes of matroids, showing a dichotomy based on the inclusion of all rank-$(a+1)$ uniform matroids and the presence of GF(q)-representable matroids.
Contribution
It establishes a polynomial density bound for matroids in minor-closed classes, distinguishing cases based on uniform matroids and GF(q)-representability.
Findings
Density bounds are polynomial in rank for classes excluding all rank-$(a+1)$ uniform matroids.
If GF(q)-representable matroids are included, density bounds grow exponentially with rank.
The results determine the maximum density up to polynomial factors for these classes.
Abstract
We show for each positive integer that, if is a minor-closed class of matroids not containing all rank- uniform matroids, then there exists an integer such that either every rank- matroid in can be covered by at most sets of rank at most , or contains the -representable matroids for some prime power , and every rank- matroid in can be covered by at most sets of rank at most . This determines the maximum density of the matroids in up to a polynomial factor.
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
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Coding theory and cryptography
