{"schema":"vela.problem-packet.v0.1","problem":78,"statement":"Let $R(k)$ be the Ramsey number for $K_k$, the minimal $n$ such that every $2$-colouring of the edges of $K_n$ contains a monochromatic copy of $K_k$.Give a constructive proof that $R(k)>C^k$ for some constant $C>1$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A059442","name":"Array of Ramsey numbers R(n,k) (n >= 2, k >= 2) read by antidiagonals.","terms":"2,3,3,4,6,4,5,9,9,5,6,14,18,14,6,7,18,25,25,18,7,8,23","url":"https://oeis.org/A059442"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}