On the Turán Number of Km ∨ C2k-1

被引：0
|
作者：
Yan, Jingru [1 ]
机构：
[1] Jiangsu Univ, Sch Math Sci, Zhenjiang 212013, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2024年 / 40卷 / 01期
关键词：
Turan number; Even wheels; Generalized wheels; TURAN NUMBERS;
D O I：
10.1007/s00373-023-02728-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Given a graph H and a positive integer n, the Tur & aacute;n number of H of the order n, denoted by ex(n, H), is the maximum size of a simple graph of order n that does not contain H as a subgraph. Given graphs G and H, G boolean OR H denotes the join of G and H. In this paper, we prove ex(n, K-m boolean OR C2k-1) = [ (m+1)n(2)/2(m+2) ] for n >= 2(m + 2)k - 3(m + 2) - 1.
引用
收藏
页数：5
相关论文
共 50 条
12345