The Ramsey numbers of stars versus wheels

For two given graphs G(1) and G(2), the Ramsey number R(G(1), G(2)) is the smallest positive integer n such that for any graph G of order it, either G contains G(1) or the complement of G contains G(2). Let S-n denote a star of order it and W-m a wheel of order m + 1. This paper shows that R (S-n, W-6) = 2n + 1 for n > 3 and R(S-n, W-m) = 3n - 2 for in odd and n greater than or equal to m - 1 greater than or equal to 2. (C) 2003 Elsevier Ltd. All rights reserved.