Triples in matroid circuits
We prove that, if $X$ is a four-element independent set in a vertically $5$-connected representable matroid $M$, then either there is a circuit of $M$ that contains at least three elements of $X$, or there is a representation $A$ of $M$ such that each column of $A$ has at most two non-zero elements and each of the columns indexed by $X$ has exactly one non-zero element. We also prove a version of this result without the connectivity assumptions.
Authors
- Geoff Whittle (ORCID: https://orcid.org/0000-0003-0499-6389)
- Jim Geelen (ORCID: https://orcid.org/0000-0003-0411-7903)
- Bert Gerards
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.20960
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint