Dense PG(n-1,2)-free binary matroids
Abstract
For each integer n ≥ 2, we prove that, if M is a simple rank-r PG(n-1,2)-free binary matroid with |M|>(1-32n)2r, then there is a triangle-free corank-(n-2) flat of M.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.