{"schema":"vela.problem-packet.v0.1","problem":559,"statement":"Let $\\hat{R}(G)$ denote the size Ramsey number, the minimal number of edges $m$ such that there is a graph $H$ with $m$ edges that is Ramsey for $G$.If $G$ has $n$ vertices and maximum degree $d$ then prove that\\[\\hat{R}(G)\\ll_d n.\\]","status":"solved","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)"}