The Ramsey numbers for cycles versus wheels of even order

For two given graphs G1G1 and G2G2, the Ramsey number R(G1,G2)R(G1,G2) is the smallest integer nn such that for any graph GG of order nn, either GG contains G1G1 or the complement of GG contains G2G2. Let CnCn denote a cycle of order nn and WmWm a wheel of order m+1m+1. Surahmat, Baskoro and Tomescu conjectured that R(Cn,Wm)=3n−2R(Cn,Wm)=3n−2 for mm odd, n≥m≥3n≥m≥3 and (n,m)≠(3,3)(n,m)≠(3,3). In this paper, we confirm the conjecture for n≥20n≥20.