{"schema":"vela.problem-packet.v0.1","problem":1031,"statement":"If $G$ is a graph on $n$ vertices which contains no trivial (empty or complete) subgraph on $\\geq 10\\log n$ many vertices, then must $G$ contain an induced non-trivial regular subgraph on $\\gg \\log n$ many vertices?","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)"}