Skip to main content
profile image
Selected Works of Bernard Lidický
Article
On the Turán Number of Forests
Electronic Journal of Combinatorics (2013)
  • Bernard Lidicky, University of Illinois at Urbana-Champaign
  • Hong Liu, University of Illinois at Urbana-Champaign
  • Cory Palmer, University of Illinois at Urbana-Champaign
Download Find in your library
Abstract
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 nd the unique extremal graph for forests consisting of
paths when n is suciently 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.
Keywords
  • Graph Theory,
  • Forest,
  • Edges
Disciplines
Publication Date
2013
Citation Information
Bernard Lidicky, Hong Liu and Cory Palmer. "On the Turán Number of Forests" Electronic Journal of Combinatorics Vol. 20 Iss. 2 (2013) p. P62-1 - P62-13
Available at: http://works.bepress.com/bernard-lidicky/8/
Creative Commons license
Creative Commons License
This work is licensed under a Creative Commons CC_BY International License.