1 Let Tn denote a tree of order n and Wm a wheel of order m+1. In this paper, we show the Ramsey 2 numbers R(Tn , W6) = 2n − 1 + μ for n ≥ 5, where μ = 2 if Tn = Sn, μ = 1 if Tn = Sn(1, 1) or 3 Tn = Sn(1, 2) and n ≡ 0 (mod 3), and μ = 0 otherwise; R(Tn , W7) = 3n − 2 for n ≥ 6. 4 © 2005 Elsevier Ltd. All rights reserved. 5
