{"schema":"vela.problem-packet.v0.1","problem":923,"statement":"Is it true that, for every $k$, there is some $f(k)$ such that if $G$ has chromatic number $\\geq f(k)$ then $G$ contains a triangle-free subgraph with chromatic number $\\geq k$?","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)"}