{"schema":"vela.problem-packet.v0.1","problem":555,"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$. Determine the value of\\[R_k(C_{2n}).\\]","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A389313","name":"a(n) is the smallest m such that for every red-blue edge-coloring of the graph K_{m} there exists either a red or a blue n-cycle; Ramsey number r(C_n, C_n).","terms":"6,6,9,8,13,11,17,14,21,17,25,20,29,23,33,26,37,29,41,32,45,35,49,38,53,41,57,44,61,47,65,50,69,53,73,56,77,59,81,62,85,6","url":"https://oeis.org/A389313"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}