{"schema":"vela.problem-packet.v0.1","problem":640,"statement":"Let $k\\geq 3$. Does there exist some $f(k)$ such that if a graph $G$ has chromatic number $\\geq f(k)$ then $G$ must contain some odd cycle whose vertices span a graph of chromatic number $\\geq k$?","status":"open","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)"}