On the Turan number of forests

Bernard Lidický · Hong Liu · Cory Palmer

2012 · arXiv preprint1 Foruma page view

Primary:math.COCombinatorics

arXiv:1204.3102v1Source snapshot · 13 Apr 2012View source

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 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.

Source details & snapshots (1)

arXiv descriptive metadata (CC0). Original paper remains at arXiv.

First submitted 13 Apr 2012. Metadata retrieved 25 Oct 2026. Page created 25 Oct 2026.

A discussion page is not an endorsement, formal review, or proof verification.

Discussions

0 published

No published discussions yet.

0 discussions