Papers
Topics
Authors
Recent
Search
2000 character limit reached

The smallest matroids with no large independent flat

Published 4 Sep 2019 in math.CO | (1909.02045v2)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.