{"schema":"vela.problem-packet.v0.1","problem":87,"statement":"Let $\\epsilon >0$. Is it true that, if $k$ is sufficiently large, then\\[R(G)>(1-\\epsilon)^kR(k)\\]for every graph $G$ with chromatic number $\\chi(G)=k$? Even stronger, is there some $c>0$ such that, for all large $k$, $R(G)>cR(k)$ for every graph $G$ with chromatic number $\\chi(G)=k$?","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)"}