Projective geometries in exponentially dense matroids. I
Combinatorics
2012-09-10 v1
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.
Cite
@article{arxiv.1209.1496,
title = {Projective geometries in exponentially dense matroids. I},
author = {Jim Geelen and Peter Nelson},
journal= {arXiv preprint arXiv:1209.1496},
year = {2012}
}