2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/70989We find the Ramsey number of a cycle vs. a complete graph when the order of the cycle is at least 4 times as large as the order of the complete graph. This partially confirms a conjecture of Erdős, Faudree, Rousseau, and Schelp made in 1978.23 pages, accepted in Comb. Prob. and CompCombinatorics05D10text