A solution to Erdős and Hajnal's odd cycle problem
Abstract In an $n$-vertex graph, it is simple to see that $n$ edges imply the graph has a cycle. However, this cycle can be any length from $3$ to $n$. If we have more edges, do we get cycles of ma...