On a conjecture of Erdos and Simonovits: Even Cycles

Peter Keevash, Benny Sudakov, Jacques Verstraete

Let $\mc{F}$ be a family of graphs. A graph is {\em $\mc{F}$-free} if it contains no copy of a graph in $\mc{F}$ as a subgraph. A cornerstone of extremal graph theory is the study…