Dense PG(n-1,2)-free binary matroids
classification
🧮 math.CO
keywords
binaryfreecorank-denseflatfracintegerleft
read the original abstract
For each integer $n \geq 2$, we prove that, if $M$ is a simple rank-$r$ $PG(n-1,2)$-free binary matroid with $|M|>\left(1-\frac{3}{2^n}\right)2^r$, then there is a triangle-free corank-$(n-2)$ flat of $M$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.