Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654788 | European Journal of Combinatorics | 2008 | 11 Pages |
Abstract
For two given graphs G1G1 and G2G2, the Ramsey number R(G1,G2)R(G1,G2) is the smallest positive integer nn such that for any graph GG of order nn, either GG contains G1G1 or the complement of GG contains G2G2. Let SnSn denote a star of order nn and WmWm a wheel of order m+1m+1. In this paper, we show that R(Sn,W8)=2n+2R(Sn,W8)=2n+2 for n≥6n≥6 and n≡0(mod2).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yunqing Zhang, Yaojun Chen, Kemin Zhang,