The Ramsey numbers of large cycles versus wheels (Q856890)

A cycle \(C_n\) of length \(n\geq 3\) is a connected graph on \(n\) vertices in which every vertex has degree two. A wheel \(W_n\) is a graph on \(n+1\) vertices obtained from a cycle \(C_n\) by adding one vertex which is adjacent to all vertices of \(C_n\). The authors show that \(R(C_n,W_m)=2n-1\) whenever \(m\) is even and \(n+1\geq 5m/2\).