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

TL;DR
This paper proves that large binary matroids avoiding a projective geometry of dimension n-1 contain a specific flat with no triangles, revealing structural properties of such matroids.
Contribution
It establishes a new extremal bound for binary matroids excluding a projective geometry, identifying the existence of a triangle-free flat under certain size conditions.
Findings
Large PG(n-1,2)-free binary matroids have a triangle-free flat of corank n-2.
The size threshold for the matroid guarantees the existence of the flat.
The result extends understanding of the structure of binary matroids avoiding certain projective geometries.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
