Journal
DISCRETE MATHEMATICS
Volume 340, Issue 2, Pages 132-139Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disc.2016.08.004
Keywords
Turan number; Extremal graph; Disjoint path
Categories
Funding
- National Natural Science Foundation of China [11531001, 11271256]
- Joint NSFC-ISF Research Program (National Natural Science Foundation of China) [11561141001]
- Joint NSFC-ISF Research Program (Israel Science Foundation) [11561141001]
- Innovation Program of Shanghai Municipal Education Commission [14ZZ016]
- Specialized Research Fund for the Doctoral Program of Higher Education [20130073110075]
Ask authors/readers for more resources
The Turk number of a graph H, denoted by ex(n, H), is the maximum number of edges in a simple graph of order n which does not contain H as a subgraph. In this paper, we determine the value ex(n, k . P-3) and characterize all extremal graphs for all positive integers n and k, where k . P-3 is k disjoint copies of a path on three vertices. This extends a result of Bushaw and Kettle (2011), which solved the conjecture proposed by Gorgol (2011). (C) 2016 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
