Projective geometries in exponentially dense matroids. II
Peter Nelson

TL;DR
This paper characterizes the structure and density of minor-closed classes of matroids, showing that such classes either have polynomially bounded coverings or contain dense GF(q)-representable matroids, with implications for their maximum density.
Contribution
It establishes a dichotomy for minor-closed matroid classes based on their density and structural properties, extending projective geometry concepts to dense matroids.
Findings
Classes either have polynomial covering bounds or contain dense GF(q)-representable matroids.
Maximum density of matroids in these classes is determined up to a constant factor.
Provides a structural characterization linking density and representability.
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 rank- sets, or contains the GF-representable matroids for some prime power and every rank- matroid in can be covered by at most rank- sets. In the latter case, this determines the maximum density of matroids in up to a constant 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 Labeling and Dimension Problems · graph theory and CDMA systems
