Ramsey multiplicity and extremal colorings for odd cycles

Abstract

The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $N$ such that every red/blue edge-coloring of the complete graph $K_N$ on $N$ vertices contains a monochromatic copy of $H$. The Ramsey multiplicity $M(H,n)$ is the minimum number of monochromatic copies of $H$ over all red/blue edge-colorings of $K_n$. It is called threshold Ramsey multiplicity if $n=r(H)$, and denoted by $m(H)$. The only previously known general infinite family for which $m(H)$ has been determined is stars, due to Harary and Prins (1974). Let $C_k$ denote a cycle on $k$ vertices. Conlon, Fox, Sudakov, and Wei (2022) conjectured that $m(C_k)=(k-1)!/2$ for every sufficiently large odd integer $k$. In this paper, we determine $M(C_k,r(C_k)+\ell )$ for every fixed nonnegative integer $\ell$ and all sufficiently large odd $k$, and characterize all extremal colorings, thereby confirming the conjecture. This is also a second general infinite family for which $m(H)$ has been determined.