{"schema":"vela.problem-packet.v0.1","problem":1010,"statement":"Let $t<\\lfloor n/2\\rfloor$. Does every graph on $n$ vertices with $\\lfloor n^2/4\\rfloor+t$ edges contain at least $t\\lfloor n/2\\rfloor$ 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)"}