{"schema":"vela.problem-packet.v0.1","problem":1018,"statement":"Let $\\epsilon>0$. Is there a constant $C_\\epsilon$ such that, for all large $n$, every graph on $n$ vertices with at least $n^{1+\\epsilon}$ edges must contain a subgraph on at most $C_\\epsilon$ vertices which is non-planar?","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)"}