Multicolor Ramsey numbers of odd cycles are superexponential
In a recent breakthrough, OpenAI proved that the $k$-color Ramsey number of the triangle $C_3$ grows super-exponentially, more precisely, they proved that $R_k(C_3)\ge k^{k/3-o(k)}$. In this short note, we present a modification of their recursive construction that works for multicolor Ramsey numbers of fixed odd cycle...