1 problem

Let $\ell\geqslant2$, and write … for the maximum number of edges in an $n$-vertex graph containing none of the cycles $C_3,C_4,\ldots,C_{2\ell}$. Erd s–Simonovits conjecture. … Th…