The Maximum Number of Stars in a Graph Without Linear Forest

被引：0
|
作者：
Huang, Sumin [1 ]
Qian, Jianguo [1 ]
机构：
[1] Xiamen Univ, Sch Math Sci, Xiamen 361005, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2022年 / 38卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Turan number; Generalized Turan number; Star; Linear forest; TURAN NUMBER; COPIES;
D O I：
10.1007/s00373-022-02580-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For two graphs J and H, the generalized Turan number, denoted by ex(n, J, H), is the maximum number of copies of J in an H-free graph of order n. A linear forest F is the disjoint union of paths. In this paper, we determine ex(n, S-r, F) when n is large enough, which generalizes the results on ex(n, S-r, P-k) and ex(n, (k + 1)P-2). Finally, we prose a problem related to the number of graph copies in an F-free graph under shifting operations.
引用
收藏
页数：12
相关论文
共 50 条
12345