On the Turán number of forests (Q396789): Difference between revisions

Summary: The Turán number of a graph \(H, \mathrm{ex}(n,H)\), is the maximum number of edges in a graph on \(n\) vertices which does not have \(H\) as a subgraph. We determine the Turán number and find the unique extremal graph for forests consisting of paths when \(n\) is sufficiently large. This generalizes a result of \textit{N. Bushaw} and \textit{N. Kettle} [Comb. Probab. Comput. 20, No. 6, 837--853 (2011; Zbl 1234.05128)]. We also determine the Turán number and extremal graphs for forests consisting of stars of arbitrary order.