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.
机构:
Central European University, Budapest, Hungary
Alfréd Rényi Institute of Mathematics, Budapest, HungaryCentral European University, Budapest, Hungary
Ghosh, Debarun
Győri, Ervin
论文数: 0引用数: 0
h-index: 0
机构:
Central European University, Budapest, Hungary
Alfréd Rényi Institute of Mathematics, Budapest, HungaryCentral European University, Budapest, Hungary
Győri, Ervin
Paulos, Addisu
论文数: 0引用数: 0
h-index: 0
机构:
Central European University, Budapest, Hungary
Alfréd Rényi Institute of Mathematics, Budapest, HungaryCentral European University, Budapest, Hungary
Paulos, Addisu
Xiao, Chuanqi
论文数: 0引用数: 0
h-index: 0
机构:
Central European University, Budapest, Hungary
Alfréd Rényi Institute of Mathematics, Budapest, HungaryCentral European University, Budapest, Hungary
Xiao, Chuanqi
Zamora, Oscar
论文数: 0引用数: 0
h-index: 0
机构:
Universidad de Costa Rica, San José, United StatesCentral European University, Budapest, Hungary