{"schema":"vela.problem-packet.v0.1","problem":22,"statement":"Let $\\epsilon>0$ and $n$ be sufficiently large depending on $\\epsilon$. Is there a graph on $n$ vertices with $\\geq n^2/8$ many edges which contains no $K_4$ such that the largest independent set has size at most $\\epsilon n$?","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)"}