Matroids with no $U_{2,n}$-minor and many hyperplanes
Adam Brown, Peter Nelson

TL;DR
This paper constructs specific matroids of any rank and prime power size that lack certain minors but have more hyperplanes than the corresponding projective geometries, revealing new extremal properties.
Contribution
It introduces a method to build matroids with no $U_{2,q+2}$-minor that surpass the hyperplane count of classical projective geometries.
Findings
Existence of such matroids for all ranks $r \\ge 3$ and prime powers $q > 10$.
Construction of matroids exceeding the hyperplane count of projective geometries.
Demonstration of extremal hyperplane properties in minor-closed classes.
Abstract
We construct, for every and every prime power , a rank- matroid with no -minor, having more hyperplanes than the rank- projective geometry over .
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 · Finite Group Theory Research
