Connectivity of Matroids with Breadth-Critical Tangles
We construct an explicit infinite sequence of nonnegative integers $(s_0,s_1,\ldots)$ such that, for every $k\ge2$, every finite matroid with a breadth-critical tangle of order at least $k$ is $(s_0,s_1,\ldots,s_{k-2})$-connected. The constants $s_i$ depend only on $i$. This proves a conjecture of Brettell, Jowett, Oxley, Semple, and Whittle.
Authors
- Zhen Chen
- Zhuo Li
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.23686
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint