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}.
机构:
Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R ChinaQinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
Mao, Yaping
Wang, Zhao
论文数: 0引用数: 0
h-index: 0
机构:
China Jiliang Univ, Coll Sci, Hangzhou 310018, Peoples R ChinaQinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
Wang, Zhao
Magnant, Colton
论文数: 0引用数: 0
h-index: 0
机构:
Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R China
UPS Amer Inc, Atlanta, GA 30328 USAQinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
Magnant, Colton
Schiermeyer, Ingo
论文数: 0引用数: 0
h-index: 0
机构:
Tech Univ Bergakad Freiberg, Inst Diskrete Math & Algebra, D-09596 Freiberg, GermanyQinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China