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

Discrete Applied Mathematics

Volumn 157, Issue 1, 2009, Pages 8-12

  Chen, Yaojun ^a   Edwin Cheng, T C ^b   Xu, Ran ^a  

^a NANJING UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Complete graph; Cycle; Ramsey number

Indexed keywords

MACHINE TOOLS;

COMPLETE GRAPH; COMPLETE GRAPHS; CYCLE; GRAPH G; INTEGER-N; RAMSEY NUMBER; RAMSEY NUMBERS;

GRAPH THEORY;

EID: 56649094480     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.04.014     Document Type: Article

References (11)

1. Bollobás B., Jayawardene C.J., Yang J.S., Huang Y.R., Rousseau C.C., and Zhang K.M. On a conjecture involving cycle-complete graph Ramsey numbers. Australasian Journal of Combinatorics 22 (2000) 63-71
2. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), Macmillan, London (Elsevier, New York)
3. Chen Y.J., Cheng T.C.E., and Zhang Y.Q. European Journal of Combinatorics 29 (2008) 1337-1352
4. Cheng T.C.E., Chen Y.J., Zhang Y.Q., and Ng C.T. The Ramsey numbers for a cycle of length six or seven versus a clique of order seven. Discrete Mathematics 307 (2007) 1047-1053
5. Erdös P., Faudree R.J., Rousseau C.C., and Schelp R.H. On cycle-complete graph Ramsey numbers. Journal of Graph Theory 2 (1978) 53-64
6. Faudree R.J., and Schelp R.H. All Ramsey numbers for cycles in graphs. Discrete Mathematics 8 (1974) 313-329
7. McKay B.D., and Zhang K.M. The value of the Ramsey number R (3, 8). Journal of Graph Theory 16 (1992) 99-105
8. Radziszowski S.P. Small Ramsey numbers. Electronic Journal of Combinatorics 1 (2006) DS1.11
9. Rosta V. On a Ramsey type problem of J.A. Bondy and P. Erdös, I & II. Journal of Combinatorial Theory, Ser. B 15 (1973) 94-120
10. 6). Journal of Graph Theory 44 (2003) 251-260
11. 4) is 3 (n - 1) + 1. Australasian Journal of Combinatorics 20 (1999) 205-206