{"schema":"vela.problem-packet.v0.1","problem":108,"statement":"For every $r\\geq 4$ and $k\\geq 2$ is there some finite $f(k,r)$ such that every graph of chromatic number $\\geq f(k,r)$ contains a subgraph of girth $\\geq r$ and chromatic number $\\geq k$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[{"id":"att_77c475e1ecd2adc2","kind":"dead_end","claim":"attempted via frontier '?' (transfer_strength=n/a) -> already_known","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)"}