Growth rate functions of dense classes of representable matroids
Peter Nelson

TL;DR
This paper establishes precise upper bounds on the size of dense matroids within certain classes of $ ext{GF}(q^2)$-representable matroids, extending understanding of their growth rates and structural limitations.
Contribution
It provides tight bounds for the number of points in large rank matroids in specific minor-closed classes of $ ext{GF}(q^2)$-representable matroids, including constructions achieving these bounds.
Findings
Derived tight upper bounds for matroid sizes in classes containing all $ ext{GF}(q)$-representable matroids.
Constructed matroids that attain these bounds, demonstrating their optimality.
Applied results to bound the size of $ ext{GF}(q^2)$-representable matroids without certain minors.
Abstract
For each proper minor-closed subclass of the -representable matroids containing all simple -representable matroids, we give, for all large , a tight upper bound on the number of points in a rank- matroid in , and construct a rank- matroid in for which equality holds. As a consequence, we give a tight upper bound on the number of points in a -representable, rank- matroid with no -minor.
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 · Limits and Structures in Graph Theory
