The Turán Number of the Graph 2P5

Halina Bielak, and Sebastian Kieliszek. "The Turán Number of the Graph 2P5." Discussiones Mathematicae Graph Theory 36.3 (2016): 683-694. <http://eudml.org/doc/285663>.

@article{HalinaBielak2016,
abstract = {We give the Turán number ex (n, 2P5) for all positive integers n, improving one of the results of Bushaw and Kettle [Turán numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853]. In particular we prove that ex (n, 2P5) = 3n−5 for n ≥ 18.},
author = {Halina Bielak, Sebastian Kieliszek},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {forest; tree; Turán number},
language = {eng},
number = {3},
pages = {683-694},
title = {The Turán Number of the Graph 2P5},
url = {http://eudml.org/doc/285663},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Halina Bielak
AU - Sebastian Kieliszek
TI - The Turán Number of the Graph 2P5
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 3
SP - 683
EP - 694
AB - We give the Turán number ex (n, 2P5) for all positive integers n, improving one of the results of Bushaw and Kettle [Turán numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853]. In particular we prove that ex (n, 2P5) = 3n−5 for n ≥ 18.
LA - eng
KW - forest; tree; Turán number
UR - http://eudml.org/doc/285663
ER -