On the Turán Number of Forests

[摘要] 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$

[学科分类] 离散数学和组合数学

[关键词] Graph Theory;Forest;Edges