{"schema":"vela.problem-packet.v0.1","problem":88,"statement":"For any $\\epsilon>0$ there exists $\\delta=\\delta(\\epsilon)>0$ such that if $G$ is a graph on $n$ vertices with no independent set or clique of size $\\geq \\epsilon\\log n$ then $G$ contains an induced subgraph with $m$ edges for all $m\\leq \\delta n^2$.","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)"}