THE TURAN NUMBER OF THE GRAPH 2P5

被引：16

作者：

Bielak, Halina ^{[1
]}

Kieliszek, Sebastian ^{[1
]}

机构：

[1] Marie Curie Sklodowska Univ, Sq Maria Curie Sklodowska 5, PL-20031 Lublin, Poland

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2016年 / 36卷 / 03期

关键词：

forest; tree; Turan number;

D O I：

10.7151/dmgt.1883

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give the Turan number ex(n, 2P(5)) for all positive integers n, improving one of the results of Bushaw and Kettle [Turan numbers of multiple paths and equibipartite forests, Combininatorics, Probability and Computing, 20 (2011) 837-853]. In particular we prove that ex(n,2P(5)) = 3n - 5 for n >= 18.

引用

页码：683 / 694

页数：12

共 5 条

[1] Turan Numbers of Multiple Paths and Equibipartite Forests
Bushaw, Neal
Kettle, Nathan
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2011, 20 (06) : 837 - 853
[2] PATH RAMSEY NUMBERS IN MULTICOLORINGS
FAUDREE, RJ
SCHELP, RH
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 19 (02) : 150 - 160
[3] Gallai T., 1959, Acta Math. Acad. Sci. Hungar., V10, P337, DOI [10.1007/BF02024498, DOI 10.1007/BF02024498]
[4] Turan Numbers for Disjoint Copies of Graphs
Gorgol, Izolda
[J]. GRAPHS AND COMBINATORICS, 2011, 27 (05) : 661 - 667
[5] Harary F., 1969, Graph theory

← 1 →