{"schema":"vela.problem-packet.v0.1","problem":134,"statement":"Let $\\epsilon,\\delta>0$ and $n$ be sufficiently large in terms of $\\epsilon$ and $\\delta$. Let $G$ be a triangle-free graph on $n$ vertices with maximum degree $<n^{1/2-\\epsilon}$. Can $G$ be made into a triangle-free graph with diameter $2$ by adding at most $\\delta n^2$ edges?","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)"}