On 2-connected graphs without cycles of length 1 modulo 3

Abstract

Burr and Erdős conjectured in 1976 that for all integers $k>\ell\geq 0$ such that $k\mathbb{Z}+\ell$ contains an even integer, every $n$-vertex graph without cycles of length $\ell$ modulo $k$ has at most a linear number of edges in $n$. Bollobás confirmed the conjecture in 1977, and Erdős further asked for the exact extremal number. To the best of our knowledge, this problem has been solved only for all residues when $k\leq 4$, and for $\ell\in \{0,2\}$ when $k\geq 5$ is odd. In particular, Bai {\it et al.} [arXiv:2503.03504] proved that if $G$ is an $n$-vertex graph with no cycles of length $1$ modulo $3$, then $e(G)\le \frac{5}{3}(n-1)$, and when $9\mid (n-1)$ the equality holds if and only if each block of $G$ is isomorphic to the Petersen graph. Note that for $n> 18$ every extremal graph contains a cut-vertex. In this paper, we investigate the 2-connected setting and determine the maximum number of edges in a 2-connected graph with no cycles of length $1$ modulo $3$. Our results provide a sharp extremal bound and a complete characterization of the extremal graphs, revealing structural differences from the general case. Combining this with the result of Bai {\it et al.}, we also obtain a complete characterization of all extremal graphs in the general setting, including the cases where $9\nmid (n-1)$. Finally, we determine the maximum number of edges in a $2$-connected graph with no cycles of length $2$ modulo $4$, whose extremal graphs differ substantially from those in the general setting. Consequently, the extremal numbers for $2$-connected graphs with no cycle of a fixed length modulo $k$ are now determined for all $k\leq 4$.