Turán type problems for a fixed graph and a linear forest

Haixiang Zhang, Xiamiao Zhao, Mei Lu

Let $\mathcal{F}$ be a family of graphs. A graph $G$ is $\mathcal{F}$-free if $G$ does not contain any $F\in \mathcal{F}$ as a subgraph. The Turán number, denoted by $ex(n, \mathsc…