{"schema":"vela.problem-packet.v0.1","problem":1104,"statement":"Let $f(n)$ be the maximum possible chromatic number of a triangle-free graph on $n$ vertices. Estimate $f(n)$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A292528","name":"Minimal number of vertices in a triangle-free graph with chromatic number n.","terms":"1,2,5,11,22","url":"https://oeis.org/A292528"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}