The maximum number of stars in a graph without linear forest

Sumin Huang, Jianguo Qian

For two graphs $J$ and $H$, the generalized Turán number, denoted by $ex(n,J,H)$, is the maximum number of copies of $J$ in an $H$-free graph of order $n$. A linear forest $F$ is t…