02124082

j

02124082 Surahmat Baskoro, E.T. Broersma, H.J. The Ramsey numbers of large cycles versus small wheels. Integers 4, Paper A10, 9 p., electronic only (2004). 2004 Walter de Gruyter, Berlin EN Ramsey number For graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest integer $N$ such that for every graph $F$ on $N$ vertices either $F$ contains a copy of $G$ as a subgraph or $\overline F$, the complement of $F$, contains a copy of $H$ as a subgraph. In this paper the authors compute: $R(C_n, W_4) = 2n- 1$ and $R(C_n, W_5) = 3n-2$, for $n > 5$. Jack E. Graver (Syracuse)