{"schema":"vela.problem-packet.v0.1","problem":556,"statement":"Let $R_3(G)$ denote the minimal $m$ such that if the edges of $K_m$ are $3$-coloured then there must be a monochromatic copy of $G$. Show that\\[R_3(C_n) \\leq 4n-3.\\]","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A389335","name":"a(n) is the smallest m such that for every red-green-blue edge-coloring of the graph K_{m} there exists at least one red, green or blue n-cycle; Ramsey number r(C_n, C_n, C_n).","terms":"17,11,17,12,25,16","url":"https://oeis.org/A389335"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}