The Ramsey number R (C8, K8)

Discrete Mathematics

Volumn 309, Issue 5, 2009, Pages 1084-1090

  Zhang, Yunqing ^a   Zhang, Ke Min ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

Complete graph; Cycle; Ramsey number

Indexed keywords

GRAPH THEORY;

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

MACHINE TOOLS;

EID: 60549107354     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.11.064     Document Type: Article

References (10)

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 and Elsevier, New York
3. 8), European Journal of Combinatorics (in press)
4. Edwin Cheng T.C., 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. Radziszowski S.P. Small Ramsey numbers. Electronic Journal of Combinatorics 1 (2004) DS1.10
8. Rosta V. On a Ramsey type problem of J. A. Bondy and P. Erdös, I & II. Journal of Combinatorial Theory, Series B 15 (1973) 94-120
9. 6). Journal of Graph Theory 44 (2003) 251-260
10. 4) is 3 (n - 1) + 1. Australasian Journal of Combinatorics 20 (1999) 205-206