On the Turán number of forests

Bernard Lidický, Hong Liu, Cory Palmer

Research output: Contribution to journalArticlepeer-review

48 Scopus citations

Abstract

The Tuŕan 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 Tuŕan 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 Tuŕan number and extremal graphs for forests consisting of stars of arbitrary order.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume20
Issue number2
StatePublished - 2013

Fingerprint

Dive into the research topics of 'On the Turán number of forests'. Together they form a unique fingerprint.

Cite this