Matroids with no U_2,n-minor and many hyperplanes

2017/08/22 by Adam Brown, Peter Nelson, Brown, Adam +1
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1708.06790

openalex publication_date 2017/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We construct, for every r ≥ 3 and every prime power q > 10, a rank-r matroid with no U_2,q+2-minor, having more hyperplanes than the rank-r projective geometry over GF(q).

Related

• The number of lines in a matroid with no U_2,n-minor
• The number of rank-k flats in a matroid with no U_2,n-minor
• The smallest matroids with no large independent flat
• Projective geometries in exponentially dense matroids. I
• Projective geometries in exponentially dense matroids. II