On a conjecture involving cycle-complete graph Ramsey numbers

Authors

Béla Bollobás, University of MemphisFollow
Chula Jayawardene, University of Colombo
Jiansheng Yang, Shanghai University
Huang Yi Ru, Shanghai University
Cecil Rousseau, University of Memphis
Zhang Ke Min, Nanjing University

Abstract

It has been conjectured that r(Cn, Km) = (m - 1)(n - 1) + 1 for all (n, m) ≠ (3,3) satisfying n ≥ m. We prove this for the case m = 5.

Publication Title

Australasian Journal of Combinatorics

Recommended Citation

Bollobás, B., Jayawardene, C., Yang, J., Ru, H., Rousseau, C., & Min, Z. (2000). On a conjecture involving cycle-complete graph Ramsey numbers. Australasian Journal of Combinatorics, 22, 63-71. Retrieved from https://digitalcommons.memphis.edu/facpubs/5243