{"schema":"vela.problem-packet.v0.1","problem":1078,"statement":"Let $G$ be an $r$-partite graph with $n$ vertices in each part. If $G$ has minimum degree $\\geq (r-\\frac{3}{2}-o(1))n$ then $G$ must contain a $K_r$.","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)"}