{"schema":"vela.problem-packet.v0.1","problem":747,"statement":"How large should $\\ell(n)$ be such that, almost surely, a random $3$-uniform hypergraph on $3n$ vertices with $\\ell(n)$ edges must contain $n$ vertex-disjoint edges?","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)"}