Ramsey numbers of cycles versus multiple wheels

For given graphs G and H, the Ramsey number R(G,H) is defined as the smallest positive integer N such that every red-blue edge-coloring of the complete graph K_N contains either a red copy of G or a blue copy of H. We denote by C_n the cycle on n vertices and by {tW₂ₘ} the disjoint union of t copies of the wheel {W₂ₘ} . We prove that for m ≥ 2 and n ≥ 4tm, R( C_n , {tW₂ₘ} ) = 2n + t-2. This result generalizes previous findings by Surahmat, Baskoro, and Tomescu (Discrete Math., 2006), Chen, Cheng, Miao, and Ng (Appl. Math. Lett., 2009), Zhang, Broersma, and Chen (Graph Combin., 2015), as well as Sudarsana (Electron. J. Graph Theory Appl., 2021). Furthermore, the result confirms Sudarsana’s conjecture for wheels of odd order.