{"schema":"vela.problem-packet.v0.1","problem":560,"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 such that in any $2$-colouring of the edges of $H$ there is a monochromatic copy of $G$. Determine\\[\\hat{R}(K_{n,n}),\\]where $K_{n,n}$ is the complete bipartite graph with $n$ vertices in each component.","status":"open","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)"}