Projective geometries in exponentially dense matroids. I.
From MaRDI portal
Publication:2347849
Abstract: We show for each positive integer that, if is a minor-closed class of matroids not containing all rank- uniform matroids, then there exists an integer such that either every rank- matroid in can be covered by at most sets of rank at most , or contains the -representable matroids for some prime power , and every rank- matroid in can be covered by at most sets of rank at most . This determines the maximum density of the matroids in up to a polynomial factor.
Recommendations
Cites work
- Cliques in dense GF(\(q\))-representable matroids
- Complete arcs
- Growth rates of minor-closed classes of matroids
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Projective geometries in dense matroids
- Projective geometries in exponentially dense matroids. II.
- Some open problems on excluding a uniform matroid
- The Erdös-Pósa property for matroid circuits
Cited in
(13)- Size functions of subgeometry-closed classes of representable combinatorial geometries
- Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\)
- On density-critical matroids
- Counting matroids in minor-closed classes
- A density Hales-Jewett theorem for matroids
- Projective geometries in exponentially dense matroids. II.
- The structure of matroids with a spanning clique or projective geometry
- Projective geometries in dense matroids
- Matroids Denser than a Projective Geometry
- The extremal function for excluding geometry minors over prime fields
- Excluding a line from complex-representable matroids
- Matroids with no \((q+2)\)-point-line minors
- Some open problems on excluding a uniform matroid
This page was built for publication: Projective geometries in exponentially dense matroids. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347849)