{"schema":"vela.problem-packet.v0.1","problem":814,"statement":"Let $k\\geq 2$ and $G$ be a graph with $n\\geq k-1$ vertices and\\[(k-1)(n-k+2)+\\binom{k-2}{2}+1\\]edges. Does there exist some $c_k>0$ such that $G$ must contain an induced subgraph on at most $(1-c_k)n$ vertices with minimum degree at least $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)"}