Extremal graphs without long paths and a given graph

Yichong Liu, Liying Kang

For a family of graphs $\mathcal{F}$, the Turán number $ex(n,\mathcal{F})$ is the maximum number of edges in an $n$-vertex graph containing no member of $\mathcal{F}$ as a subgraph…