On the Turan number of forests

Bernard Lidický, Hong Liu, Cory Palmer

The Turan number of a graph H, 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 Turan number and find the uniq…