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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Triples in matroid circuits

Geoff Whittle, Jim Geelen, Bert Gerards
arXiv (Cornell University)
Advanced Graph Theory Research
preprint

Triples in matroid circuits

Geoff Whittle, Jim Geelen, Bert Gerards
preprint en

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.

arXiv (Cornell University)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon