The Turan Number of Disjoint Copies of Paths

preprint2015arXivOpen access

Abstract

The Turán number of a graph HH, ex(n,H)ex(n,H), is the maximum number of edges in a simple graph of order nn which does not contain HH as a subgraph. Let k⋅P3k\cdot P_3 denote kk disjoint copies of a path on 33 vertices. In this paper, we determine the value ex(n,k⋅P3)ex(n, k\cdot P_3) and characterize all extremal graphs. This extends a result of Bushaw and Kettle [N. Bushaw and N. Kettle, Turán Numbers of multiple and equibipartite forests, Combin. Probab. Comput., 20(2011) 837-853.], which solved the conjecture proposed by Gorgol in [I. Gorgol. Turán numbers for disjoint copies of graphs. {\it Graphs Combin.}, 27 (2011) 661-667.].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.