Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23751
Title: The Ramsey numbers for cycles versus wheels of even order
Authors: Zhang, L
Chen, Y
Cheng, TCE 
Issue Date: 2010
Publisher: Academic Press
Source: European journal of combinatorics, 2010, v. 31, no. 1, p. 254-259 How to cite?
Journal: European journal of combinatorics 
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. Surahmat, Baskoro and Tomescu conjectured that R (Cn, Wm) = 3 n - 2 for m odd, n ≥ m ≥ 3 and (n, m) ≠ (3, 3). In this paper, we confirm the conjecture for n ≥ 20.
URI: http://hdl.handle.net/10397/23751
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2008.12.022
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 17, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Aug 21, 2017

Page view(s)

34
Last Week
1
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



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