{"schema":"vela.problem-packet.v0.1","problem":565,"statement":"Let $R^*(G)$ be the induced Ramsey number: the minimal $m$ such that there is a graph $H$ on $m$ vertices such that any $2$-colouring of the edges of $H$ contains an induced monochromatic copy of $G$.Is it true that\\[R^*(G) \\leq 2^{O(n)}\\]for any graph $G$ on $n$ vertices?","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)"}