Ramsey numbers of large even cycles and fans (Q6133155): Difference between revisions

For given graphs \(F\) and \(H\), the Ramsey number \(R(F, H)\) is the smallest positive integer \(N\) such that any red/blue edge coloring of \(K_N\) contains either a red \(F\) or a blue \(H\). Let \(C_n\) be a cycle of length \(n\) and \(F_n\) be a fan consisting of \(n\) triangles all sharing a common vertex. In this paper, the authors study the Ramsey number of even cycles versus fans and prove that for all sufficiently large \(n\), \(R(C_{2\lfloor an\rfloor}, F_n)=(2+2a+o(1))n\), if \(\frac{1}{2}\leq a<1\) and \(R(C_{2\lfloor an\rfloor}, F_n)=(4a+o(1))n\), if \(a\geq 1\).