{"schema":"vela.problem-packet.v0.1","problem":751,"statement":"Let $G$ be a graph with chromatic number $\\chi(G)=4$. If $m_1<m_2<\\cdots$ are the lengths of the cycles in $G$ then can $\\min(m_{i+1}-m_i)$ be arbitrarily large? Can this happen if the girth of $G$ is large?","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)"}