Dense PG(n-1,2)-free binary matroids
Combinatorics
2016-05-24 v1
Abstract
For each integer , we prove that, if is a simple rank- -free binary matroid with , then there is a triangle-free corank- flat of .
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