{"schema":"vela.problem-packet.v0.1","problem":596,"statement":"For which graphs $G_1,G_2$ is it true that for every $n\\geq 1$ there is a graph $H$ without a $G_1$ but if the edges of $H$ are $n$-coloured then there is a monochromatic copy of $G_2$, and yet for every graph $H$ without a $G_1$ there is an $\\aleph_0$-colouring of the edges of $H$ without a monochromatic $G_2$.","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)"}