Turán numbers of cycles plus a general graph

Chunyang Dou, Fu-tao Hu, Xing Peng

For a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-free if it does not contain a member of $\mathcal{F}$ as a subgraph. The Turán number $\text{ex}(n,\mathcal{F})$ is the maximum n…