Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18902
Title: The Ramsey number for a cycle of length six versus a clique of order eight
Authors: Chen, Y
Cheng, TCE 
Xu, R
Keywords: Complete graph
Cycle
Ramsey number
Issue Date: 2009
Source: Discrete applied mathematics, 2009, v. 157, no. 1, p. 8-12 How to cite?
Journal: Discrete Applied Mathematics 
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 Cm denote a cycle of length m and Kn a complete graph of order n. In this paper, it is shown that R (C6, K8) = 36.
URI: http://hdl.handle.net/10397/18902
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.04.014
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

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

Page view(s)

36
Last Week
3
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.