The Ramsey numbers R (Cm, K7) and R (C7, K8)

European Journal of Combinatorics

Volumn 29, Issue 5, 2008, Pages 1337-1352

  Chen, Yaojun ^a   Edwin Cheng, T C ^b   Zhang, Yunqing ^a  

^a NANJING UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 42949096111     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.05.007     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. 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
4. Chvátal V., and Erdös P. A note on hamiltonian circuits. Discrete Mathematics 2 (1972) 111-113
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. Ore O. Note on Hamilton circuits. American Mathematical Monthly 67 (1960) 55
8. Radziszowski S.P. Small Ramsey numbers. Electronic Journal of Combinatorics (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, Series 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