Generalized Turán Problems for Even Cycles 7: The Maximum Number of Paths on l Vertices in a C_{2k+1}-Free Graph on n Vertices Is (1+o(1))(n/2)^lResearch Paper
An extremal graph problem asks how many copies of a chosen small graph can occur when a different graph is forbidden. The usual Turán problem counts edges; counting paths or cycles gives a more detailed view of the structure that can survive a forbidden subgraph. Gerbner, Győri, Methuku and Vizer study these generalized Turán numbers for paths and cycles in…