{"schema":"vela.problem-packet.v0.1","problem":740,"statement":"Let $\\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\\mathfrak{m}$. Let $r\\geq 1$. Must $G$ contain a subgraph of chromatic number $\\mathfrak{m}$ which does not contain any odd cycle of length $\\leq r$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[{"id":"att_043c663367ce09aa","kind":"dead_end","claim":"attempted via frontier '?' (transfer_strength=n/a) -> no_progress","grade":"honest_null","gateStatus":"needs_verification","superseded":false}],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}