Back to Search Start Over

The Ramsey number for a cycle of length six versus a clique of order eight

Authors :
Chen, Yaojun
Edwin Cheng, T.C.
Xu, Ran
Source :
Discrete Applied Mathematics. Jan2009, Vol. 157 Issue 1, p8-12. 5p.
Publication Year :
2009

Abstract

Abstract: For two given graphs and , the Ramsey number is the smallest integer such that for any graph of order , either contains or the complement of contains . Let denote a cycle of length and a complete graph of order . In this paper, it is shown that . [Copyright &y& Elsevier]

Details

Language :
English
ISSN :
0166218X
Volume :
157
Issue :
1
Database :
Academic Search Index
Journal :
Discrete Applied Mathematics
Publication Type :
Academic Journal
Accession number :
35501431
Full Text :
https://doi.org/10.1016/j.dam.2008.04.014