A theorem on cycle-wheel Ramsey number
A theorem on cycle-wheel Ramsey number
复制标题
DOI：
10.1016/j.disc.2011.11.022
复制
发表时间：
2012-03
期刊：
影响因子：
--
通讯作者：
Yaojun Chen;T. Cheng;C. T. Ng;Yunqing Zhang
中科院分区：
文献类型：
--
作者：
Yaojun Chen;T. Cheng;C. T. Ng;Yunqing Zhang
对于给定的两个图G1和G2，Ramsey数R（G1，G2）是最小整数N，使得对于任意一个N阶图G，要么G包含G1，要么G的补图包含G2.设Cn为n阶圈，Wma为m+1阶轮.本文证明了Surahmat，Baskoro和Tomescu证明的R（Cn，Wm）=3n−2，其中m为奇数，n≥m≥3且（n，m）≠（3，3）.
For two given graphs G1and G2, the Ramsey number R(G1,G2) is the smallest integer N such that for any graph G of order N, either G contains G1or the complement of G contains G2. Let Cndenote a cycle of order n and Wma wheel of order m+1. In this paper, we show that R(Cn,Wm)=3n−2 for m odd, n≥m≥3 and (n,m)≠(3,3), which was conjectured by Surahmat, Baskoro and Tomescu.