Paperlane

no. 17 · Wednesday 18 November 2026

Cubic graphs with circumference ratio 21/22 and cyclic connectivity 5

Ján Mazák

math.CO

Abstract

We construct a cyclically $5$-connected cubic graph of order $22m$ and circumference $21m$ for every $m\geq 3$. Consequently, the shortness coefficient of the class of cyclically $5$-connected cubic graphs is at most $21/22$, improving the previously known upper bound of $24/25$. We also demonstrate how I-reductions, which delete an edge and suppress its two end-vertices, can be used to prove cyclic connectivity.

fields
Combinatorics
pdf ↗ page arXiv:2611.22037 ↗