{"schema":"vela.problem-packet.v0.1","problem":1020,"statement":"Let $f(n;r,k)$ be the maximal number of edges in an $r$-uniform hypergraph which contains no set of $k$ many independent edges. For all $r\\geq 3$,\\[f(n;r,k)=\\max\\left(\\binom{rk-1}{r}, \\binom{n}{r}-\\binom{n-k+1}{r}\\right).\\]","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)"}