Turán's Problem for Trees

الأصل · EN

For a forbidden graph L, let ex(p;L) denote the maximal number of edges in a simple graph of order p not containing L. Let Tₙ denote the unique tree on n vertices with maximal degree n-2, and let Tₙ*=(V,E) be the tree on n vertices with V={v₀,v₁,,vₙ₋₁} and E={v₀v₁,,v₀vₙ₋₃,vₙ₋₃vₙ₋₂,vₙ₋₂vₙ₋₁}. In the paper we give exact values of ex(p;Tₙ) and ex(p;Tₙ*).