Nemotron-IMO-Bench 2026 C48

Let $\varepsilon>0$. Prove that for all but finitely many positive integers $n$, a graph with $n$ vertices and at least $(1+\varepsilon)n$ edges has two different cycles of equal length.