English

Dense PG(n-1,2)-free binary matroids

Combinatorics 2016-05-24 v1

Abstract

For each integer n2n \geq 2, we prove that, if MM is a simple rank-rr PG(n1,2)PG(n-1,2)-free binary matroid with M>(132n)2r|M|>\left(1-\frac{3}{2^n}\right)2^r, then there is a triangle-free corank-(n2)(n-2) flat of MM.

Cite

@article{arxiv.1605.06546,
  title  = {Dense PG(n-1,2)-free binary matroids},
  author = {Rutger Campbell},
  journal= {arXiv preprint arXiv:1605.06546},
  year   = {2016}
}

Comments

11 pages. Submitted for publication in JCTb

R2 v1 2026-06-22T14:06:06.224Z