Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23128
Title: The Ramsey numbers for cycles versus wheels of odd order
Authors: Chen, Y
Cheng, TCE 
Miao, Z
Ng, CT 
Keywords: Cycle
Ramsey number
Wheel
Issue Date: 2009
Publisher: Pergamon Press
Source: Applied mathematics letters, 2009, v. 22, no. 12, p. 1875-1876 How to cite?
Journal: Applied mathematics letters 
Abstract: For two given graphs G1 and G2, the Ramsey number R (G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Cn denote a cycle of order n and Wm a 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.
URI: http://hdl.handle.net/10397/23128
ISSN: 0893-9659
DOI: 10.1016/j.aml.2009.07.014
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Aug 12, 2017

Page view(s)

58
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.