{"schema":"vela.problem-packet.v0.1","problem":641,"statement":"Is there some function $f$ such that for all $k\\geq 1$ if a finite graph $G$ has chromatic number $\\geq f(k)$ then $G$ has $k$ edge disjoint cycles on the same set of vertices?","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)"}