The Ramsey number of paths with respect to wheels
The Ramsey number of paths with respect to wheels
复制标题
DOI：
10.1016/j.disc.2004.10.024
复制
发表时间：
2005-05
期刊：
影响因子：
--
通讯作者：
E. Baskoro;Surahmat
中科院分区：
文献类型：
--
作者：
E. Baskoro;Surahmat
对于图G和H，Ramsey数R（G，H）是使每个n阶图F包含G或F的补图包含H的最小正整数n.对于路径Pn，Wm，证明了当m为偶数，m ≥ 4，n ≥（m/2）（m-2）时，R（Pn，Wm）=2n-1;当m为奇数，m ≥ 5，n ≥（m-1/2）（m-3）时，R（Pn，Wm）= 3 n-2.
For graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every graph F of order n contains G or the complement of F contains H. For the path Pnand the wheel Wm, it is proved that R(Pn,Wm)=2n-1 if m is even, m⩾4, and n⩾(m/2)(m-2), and R(Pn,Wm)=3n-2 if m is odd, m⩾5, and n⩾(m-1/2)(m-3).