Long Cycles in 2-Connected Tough Graphs

RESUMO

Let $G$ be a graph. The circumference of $G$, denoted by $cir(G)$, is the length of a longest cycle in $G$, or zero if $G$ is acyclic. In 1993, Broersma, van den Heuvel, Jung, and Veldman conjectured that, for every $t>0$, there is a constant $A=A(t)>0$ such that every 2-connected $t$-tough graph of order $n$ has circumference at least $A\log n$; the conjecture is recorded as Conjecture~2 in the 2006 survey on toughness by Bauer, Broersma, and Schmeichel. In this note, we confirm the conjecture. More precisely, every 2-connected $t$-tough graph $G$ of order $n$ satisfies $cir(G)\ge \lceil \log_k((k-1)n+1)\rceil$, where $k=\lceil 1/t\rceil+2$. The proof combines Win's bounded-degree spanning tree theorem with the theorem of Briański, Joret, Majewski, Micek, Seweryn, and Sharma that the treedepth of a 2-connected graph is at most its circumference.