Generalized Turán Problems for Even Cycles 1: A C_{2k}-Free Graph on n Vertices Has at Most (1+o(1))(k−1)(k−2)n²/4 Four-Cycles, and This Is AttainedResearch Paper
The Turán problem asks for , the largest number of edges in an -vertex graph with no copy of a fixed graph . For even cycles the answer is still not known in general: Bondy and Simonovits proved in 1974, and the order of magnitude is known to be sharp only for .