Indexed by：
Abstract：
For graphs F and H, the Ramsey number R(F, H) is the smallest positive integer N such that any red/blue edge coloring of KN contains either a red F or a blue H. Let Cn be a cycle of length n and Fn be a fan consisting of n triangles all sharing a common vertex. In this paper, we prove that for all sufficiently large n, � (2 + 2a + o(1))n if 1/2 ＜ a ＜ 1, R(C2 �an �, Fn) = (4a + o(1))n if a ＞ 1.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
ELECTRONIC JOURNAL OF COMBINATORICS
ISSN： 1077-8926
Year： 2023
Issue： 3
Volume： 30
0 . 7
JCR@2023
0 . 7 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：13
JCR Journal Grade：2
CAS Journal Grade：4
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
