The cycle-complete graph ramsey numbers

Authors

V. Nikiforov, University of Memphis

Abstract

In 1978 Erdos, Faudree, Rousseau and Schelp conjectured that r(C p,Kr) = (p - 1)(r - 1) + 1 for every p ≥ r ≥ 3, except for p = q = 3. This has been proved for r ≤ 6, and for p ≥ r 2 - 2r. In this note we prove the conjecture for p ≥ 4r + 2. © 2005 Cambridge University Press.

Publication Title

Combinatorics Probability and Computing

Recommended Citation

Nikiforov, V. (2005). The cycle-complete graph ramsey numbers. Combinatorics Probability and Computing, 14 (3), 349-370. https://doi.org/10.1017/S096354830400642X