The smallest matroids with no large independent flat
Combinatorics
2020-11-13 v2
Abstract
We show that a simple rank- matroid with no -element independent flat has at least as many elements as the matroid defined as the direct sum of binary projective geometries whose ranks pairwise differ by at most . We also show for that is the unique example for which equality holds.
Keywords
Cite
@article{arxiv.1909.02045,
title = {The smallest matroids with no large independent flat},
author = {Peter Nelson and Sergey Norin},
journal= {arXiv preprint arXiv:1909.02045},
year = {2020}
}