For a given graph H, the Ramsey number r(H) is the minimum N such that any 2-edge-coloring of the complete graph K-N yields a monochromatic copy of H. Given a positive integer n, a fanF(n) is a graph formed by n triangles that share one common vertex. We show that 9n/2-5 <= r(F-n) < 11n/2+6 for any n. This improves previous best bounds r(F-n) <= 6n of Lin and Li and r(F-n) >= 4n+2 of Zhang, Broersma and Chen. (C) 2021 Elsevier Ltd. All rights reserved.
机构:
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