The Ramsey numbers of paths versus wheels

被引：19

作者：

Chen, YJ ^{[1
]}

Zhang, YQ ^{[1
]}

Zhang, KM ^{[1
]}

机构：

[1] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China

来源：

DISCRETE MATHEMATICS | 2005年 / 290卷 / 01期

关键词：

Ramsey number; path; wheel;

D O I：

10.1016/j.disc.2004.10.017

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For two given graphs G(1) and G(2), the Ramsey number R (G(1), G(2)) is the smallest integer n such that for any graph G of order n, either G contains G(1) or the complement of G contains G(2). Let P-n denote a path of order n and W-m a wheel of order m + 1. In this paper, we show that R(P-n, W-m) = 2n - 1 for m even and n greater than or equal to m - 1 greater than or equal to 3 and R(P-n, W-m) = 3n - 2 for m odd and n greater than or equal to m - 1 greater than or equal to 2. (C) 2004 Elsevier B.V. All rights reserved.

引用

页码：85 / 87

页数：3