A theorem on cycle-wheel Ramsey number

Yaojun Chen; Edwin Tai Chiu Cheng; Chi To Ng; Yunqing Zhang

doi:10.1016/j.disc.2011.11.022

A theorem on cycle-wheel Ramsey number

Yaojun Chen
, Edwin Tai Chiu Cheng
, Chi To Ng
, Yunqing Zhang

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

8 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. 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.

Original language	English
Pages (from-to)	1059-1061
Number of pages	3
Journal	Discrete Mathematics
Volume	312
Issue number	5
DOIs	https://doi.org/10.1016/j.disc.2011.11.022
Publication status	Published - 6 Mar 2012

Keywords

Cycle
Ramsey number
Wheel

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

More information

10.1016/j.disc.2011.11.022

Cite this

@article{d09d62a473da479caebfb02832c93ece,

title = "A theorem on cycle-wheel Ramsey number",

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. 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.",

keywords = "Cycle, Ramsey number, Wheel",

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

year = "2012",

month = mar,

day = "6",

doi = "10.1016/j.disc.2011.11.022",

language = "English",

volume = "312",

pages = "1059--1061",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - A theorem on cycle-wheel Ramsey number

AU - Chen, Yaojun

AU - Cheng, Edwin Tai Chiu

AU - Ng, Chi To

AU - Zhang, Yunqing

PY - 2012/3/6

Y1 - 2012/3/6

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. 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.

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. 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.

KW - Cycle

KW - Ramsey number

KW - Wheel

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

U2 - 10.1016/j.disc.2011.11.022

DO - 10.1016/j.disc.2011.11.022

M3 - Journal article

SN - 0012-365X

VL - 312

SP - 1059

EP - 1061

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 5

ER -

A theorem on cycle-wheel Ramsey number

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this