Polynomial Length Cycles In Tough Graphs

Abstract

We prove that every $n$-vertex $15$-tough graph contains a cycle of length $\Omega (n^{1/20})$.

19 pages, 3 figures