The number of rank-$k$ flats in a matroid with no $U_{2,n}$-minor
Peter Nelson

TL;DR
This paper establishes an upper bound on the number of rank-$k$ flats in large rank matroids without a certain minor, relating it to projective geometries over finite fields, thus extending matroid extremal theory.
Contribution
It proves a new extremal bound for the number of flats in matroids avoiding a specific minor, connecting matroid structure to finite field geometries.
Findings
Upper bound matches flats in projective geometries over GF(q)
Valid for sufficiently large rank r
Extends extremal matroid theory
Abstract
We show that, if and are positive integers and is sufficiently large, then the number of rank- flats in a rank- matroid with no -minor is less than or equal to number of rank- flats in a rank- projective geometry over GF, where is the largest prime power not exceeding .
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 · Finite Group Theory Research · Advanced Graph Theory Research
