Combinatorics · Oct 6, 2026
Cycle–clique Ramsey numbers
Proves the Erdős–Faudree–Rousseau–Schelp conjecture: for every , except . This is the exact threshold forcing a red m-cycle or a blue n-clique in every red–blue coloring of a complete graph.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model