{"schema":"vela.problem-packet.v0.1","problem":944,"statement":"A critical vertex, edge, or set of edges, is one whose deletion lowers the chromatic number.Let $k\\geq 4$ and $r\\geq 1$. Must there exist a graph $G$ with chromatic number $k$ such that every vertex is critical, yet every critical set of edges has size $>r$?","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)"}