The Turán number of path-star forests

Xiaona Fang, Yaojun Chen, Lihua You

The Turán number of a graph $H$, denoted by $ex(n,H)$, is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. A linear (star) forest is a for…