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

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

Connectivity of Matroids with Breadth-Critical Tangles

Zhen Chen, Zhuo Li
arXiv (Cornell University)
Advanced Graph Theory Research
preprint

Connectivity of Matroids with Breadth-Critical Tangles

Zhen Chen, Zhuo Li
preprint en

Abstract

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.

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