Cycle–clique Ramsey numbers

Proves the Erdős–Faudree–Rousseau–Schelp conjecture: $R(C_m,K_n)=(m-1)(n-1)+1$ for every $m\ge n\ge3$, except $R(C_3,K_3)=6$. This is the exact threshold forcing a red m-cycle or a blue n-clique in every red–blue coloring of a complete graph.