Erdős Problem 554

### What is the conjecture

https://www.erdosproblems.com/554

Let $R(G;k)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Show that
$$\lim_{k\to \infty}\frac{R(C_{2n+1};k)}{R(K_3;k)}=0$$
for any $n\geq 2$.

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else