On the Turan number of forests

Details On the Turan number of forests On the Turan number of forests

2012-04-13

arxiv.org/abs/1204.3102v1

Mathematics

Combinatorics

Scientific paper

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 unique extremal graph for forests consisting of paths when n is sufficiently large. This generalizes a result of Bushaw and Kettle [ Combinatorics, Probability and Computing 20:837--853, 2011]. We also determine the Turan number and extremal graphs for forests consisting of stars of arbitrary order.

Affiliated with

Also associated with

No associations

Rating

On the Turan number of forests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Turan number of forests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Turan number of forests will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33093