{"schema":"vela.problem-packet.v0.1","problem":905,"statement":"Every graph with $n$ vertices and $>n^2/4$ edges contains an edge which is in at least $n/6$ triangles.","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)"}