2000 character limit reached
The smallest matroids with no large independent flat (1909.02045v2)
Published 4 Sep 2019 in math.CO
Abstract: We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$. We also show for $r \ge 2t$ that $M_{r,t}$ is the unique example for which equality holds.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.