{"schema":"vela.problem-packet.v0.1","problem":1156,"statement":"Let $G$ be a random graph on $n$ vertices, in which every edge is included independently with probability $1/2$. Is there some constant $C$ such that that chromatic number $\\chi(G)$ is, almost surely, concentrated on at most $C$ values? Is it true that, if $\\omega(n)\\to \\infty$ sufficiently slowly, then for every function $f(n)$\\[\\mathbb{P}(\\lvert\\chi(G)-f(n)\\rvert<\\omega(n))<1/2\\]if $n$ is sufficiently large?","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)"}