加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本