{"schema":"vela.problem-packet.v0.1","problem":24,"statement":"Does every triangle-free graph on $5n$ vertices contain at most $n^5$ copies of $C_5$?","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)"}