{"schema":"vela.problem-packet.v0.1","problem":118,"statement":"Let $\\alpha$ be a cardinal or ordinal number or an order type such that every two-colouring of $K_\\alpha$ contains either a red $K_\\alpha$ or a blue $K_3$. For every $n\\geq 3$ must every two-colouring of $K_\\alpha$ contain either a red $K_\\alpha$ or a blue $K_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)"}