The Ramsey numbers for cycles versus wheels of odd order

Yaojun Chen; Edwin Tai Chiu Cheng; Zhengke Miao; Chi To Ng

doi:10.1016/j.aml.2009.07.014

The Ramsey numbers for cycles versus wheels of odd order

Yaojun Chen
, Edwin Tai Chiu Cheng
, Zhengke Miao
, Chi To Ng

Research output: Journal article publication › Journal article › Academic research › peer-review

7 Citations (Scopus)

Abstract

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. It is conjectured by Surahmat, E.T. Baskoro and I. Tomescu that R (Cn, Wm) = 2 n - 1 for even m ≥ 4, n ≥ m and (n, m) ≠ (4, 4). In this paper, we confirm the conjecture for n ≥ 3 m / 2 + 1.

Original language	English
Pages (from-to)	1875-1876
Number of pages	2
Journal	Applied Mathematics Letters
Volume	22
Issue number	12
DOIs	https://doi.org/10.1016/j.aml.2009.07.014
Publication status	Published - 1 Dec 2009

Keywords

Cycle
Ramsey number
Wheel

ASJC Scopus subject areas

Applied Mathematics

More information

10.1016/j.aml.2009.07.014

Cite this

@article{1b7eaf87b14e4653903e86c1ff40f0d5,

title = "The Ramsey numbers for cycles versus wheels of odd order",

abstract = "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. It is conjectured by Surahmat, E.T. Baskoro and I. Tomescu that R (Cn, Wm) = 2 n - 1 for even m ≥ 4, n ≥ m and (n, m) ≠ (4, 4). In this paper, we confirm the conjecture for n ≥ 3 m / 2 + 1.",

keywords = "Cycle, Ramsey number, Wheel",

author = "Yaojun Chen and Cheng, \{Edwin Tai Chiu\} and Zhengke Miao and Ng, \{Chi To\}",

year = "2009",

month = dec,

day = "1",

doi = "10.1016/j.aml.2009.07.014",

language = "English",

volume = "22",

pages = "1875--1876",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

number = "12",

}

TY - JOUR

T1 - The Ramsey numbers for cycles versus wheels of odd order

AU - Chen, Yaojun

AU - Cheng, Edwin Tai Chiu

AU - Miao, Zhengke

AU - Ng, Chi To

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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. It is conjectured by Surahmat, E.T. Baskoro and I. Tomescu that R (Cn, Wm) = 2 n - 1 for even m ≥ 4, n ≥ m and (n, m) ≠ (4, 4). In this paper, we confirm the conjecture for n ≥ 3 m / 2 + 1.

AB - 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. It is conjectured by Surahmat, E.T. Baskoro and I. Tomescu that R (Cn, Wm) = 2 n - 1 for even m ≥ 4, n ≥ m and (n, m) ≠ (4, 4). In this paper, we confirm the conjecture for n ≥ 3 m / 2 + 1.

KW - Cycle

KW - Ramsey number

KW - Wheel

UR - https://www.scopus.com/pages/publications/70349609649

U2 - 10.1016/j.aml.2009.07.014

DO - 10.1016/j.aml.2009.07.014

M3 - Journal article

SN - 0893-9659

VL - 22

SP - 1875

EP - 1876

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 12

ER -

The Ramsey numbers for cycles versus wheels of odd order

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this