Article ID Journal Published Year Pages File Type
4654472 European Journal of Combinatorics 2006 7 Pages PDF
Abstract
Let Tn denote a tree of order n and Wm a wheel of order m+1. In this paper, we show the Ramsey numbers R(Tn,W6)=2n−1+μ for n≥5, where μ=2 if Tn=Sn, μ=1 if Tn=Sn(1,1) or Tn=Sn(1,2) and n≡0(mod3), and μ=0 otherwise; R(Tn,W7)=3n−2 for n≥6.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , ,