The number of lines in a matroid with no $U_{2,n}$-minor
Jim Geelen, Peter Nelson

TL;DR
This paper establishes bounds on the number of lines in certain matroids without specific minors, showing the maximum matches projective geometries over GF(q) for small q, but not for larger q.
Contribution
It proves that for prime powers up to 5, the maximum lines in a matroid without a U_{2,q+2} minor equals that of a projective geometry over GF(q), and provides counterexamples for larger q.
Findings
Maximum lines match projective geometries over GF(q) for q ≤ 5.
Counterexamples exist for larger prime powers.
Bound does not hold universally for all prime powers.
Abstract
We show that, if is a prime power at most 5, then every rank- matroid with no -minor has no more lines than a rank- projective geometry over GF. We also give examples showing that for every other prime power this bound does not hold.
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 · Nuclear Receptors and Signaling · graph theory and CDMA systems
