For two given graphs G1and G2, the Ramsey number R(G1,G2) is the smallest integer N such that for any graph G of order N, either G contains G1or the complement of G contains G2. Let Cndenote a cycle of order n and Wma wheel of order m+1. In this paper, we show that R(Cn,Wm) = 3n-2 for m odd, n≥m≥3 and (n,m)≠(3,3), which was conjectured by Surahmat, Baskoro and Tomescu.
- Ramsey number
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics