{"schema":"vela.problem-packet.v0.1","problem":832,"statement":"Let $r\\geq 3$ and $k$ be sufficiently large in terms of $r$. Is it true that every $r$-uniform hypergraph with chromatic number $k$ has at least\\[\\binom{(r-1)(k-1)+1}{r}\\]edges, with equality only for the complete graph on $(r-1)(k-1)+1$ 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)"}