{"schema":"vela.problem-packet.v0.1","problem":545,"statement":"Let $G$ be a graph with $m$ edges and no isolated vertices. Is the Ramsey number $R(G)$ maximised when $G$ is 'as complete as possible'? That is, if $m=\\binom{n}{2}+t$ edges with $0\\leq t<n$ then is\\[R(G)\\leq R(H),\\]where $H$ is the graph formed by connecting a new vertex to $t$ of the vertices of $K_n$?","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)"}