{"schema":"vela.problem-packet.v0.1","problem":554,"statement":"Let $R_k(G)$ 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_k(C_{2n+1})}{R_k(K_3)}=0\\]for any $n\\geq 2$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}