The Turan number of star forests

被引：18
作者：
Lan, Yongxin [1 ,2 ]
Li, Tao [3 ]
Shi, Yongtang [1 ,2 ]
Tu, Jianhua [4 ]
机构：
[1] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
[2] Nankai Univ, LPMC, Tianjin 300071, Peoples R China
[3] Nankai Univ, Coll Comp Sci, Tianjin 300071, Peoples R China
[4] Beijing Univ Chem Technol, Sch Sci, Beijing 029, Peoples R China
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2019年 / 348卷
基金：
中国国家自然科学基金;
关键词：
Turan number; Extremal graphs; Star forests;
D O I：
10.1016/j.amc.2018.12.004
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The Turan number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices containing no H as a subgraph. Let S-l denote the star on l + 1 vertices and let k . S-l denote disjoint union of k copies of S-l. In this paper, for appropriately large n, we determine the Turan numbers for k . S-l and F, where F is a forest with components each of order 4, which improve the results of Lidicky et al. (2013). (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码：270 / 274
页数：5
相关论文
共 15 条
12