Polynomial Length Cycles In Tough Graphs

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