Tur\'an numbers of cycles plus a general graph
Tur\'an numbers of cycles plus a general graph
For a family of graphs $\cal F$, a graph $G$ is $\cal F$-free if it does not contain a member of $\cal F$ as a subgraph. The Tur\'an number $\textrm{ex}(n,{\cal F})$ is the maximum number of edges in an $n$-vertex graph which is $\cal F$-free. Let ${\cal C}_{\geq k}$ be …