A NOTE ON RAMSEY NUMBERS FOR FANS

被引：5
|
作者：
Zhang, Yanbo [1 ,2 ]
Broersma, Hajo [2 ]
Chen, Yaojun [1 ]
机构：
[1] Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R China
[2] Univ Twente, Fac Elect Engn Math & Comp Sci, NL-7500 AE Enschede, Netherlands
来源：
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 2015年 / 92卷 / 01期
关键词：
Ramsey number; fan; goodness; GRAPHS;
D O I：
10.1017/S0004972715000398
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For two given graphs G(1) and G(2), the Ramsey number R(G(1),G(2)) is the smallest integer N such that, for any graph G of order N, either G contains G(1) as a subgraph or the complement of G contains G(2) as a subgraph. A fan F-l is l triangles sharing exactly one vertex. In this note, it is shown that R(F-n,F-m) = 4n + 1 for n >= max {m(2) - m/2; 11m/2 - 4}.
引用
收藏
页码：19 / 23
页数：5
相关论文
共 50 条
12345