{"schema":"vela.problem-packet.v0.1","problem":1012,"statement":"Let $k\\geq 0$. Let $f(k)$ be such that every graph on $n\\geq f(k)$ vertices with at least $\\binom{n-k-1}{2}+\\binom{k+2}{2}+1$ edges contains a cycle on $n-k$ vertices. Determine or estimate $f(k)$.","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)"}