Paperlane

no. 16 · Tuesday 17 November 2026

Triples in matroid circuits

Jim Geelen, Bert Gerards and Geoff Whittle

math.CO

Abstract

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.

comments
By people, for people
fields
Combinatorics
pdf ↗ page arXiv:2611.20960 ↗