Quantitative lower bound for the chromatic number

Determine a sensible lower bound on the chromatic number of a randomly twisted hypercube as a function of the dimension n that holds with high probability.

Background

The paper proves that the chromatic number of the randomly twisted hypercube diverges with high probability: for every fixed positive constant c, the chromatic number exceeds c with high probability. The proof constructs, for each fixed c, a finite graph of chromatic number greater than c and shows that this graph appears with high probability in sufficiently large randomly twisted hypercubes.

The authors note that their inductive construction could yield a quantitative growth estimate, but that the resulting bound would be extremely weak. They therefore leave unresolved the problem of obtaining a sensible high-probability lower bound expressed directly as a function of the dimension n.

References

It remains an open question to find a sensible lower bound on $\chi\left((n)\right)$ as a function of $n$ that holds with high probability.

— Mixing time of the lazy and simple random walk on a randomly twisted hypercube  (2610.21976 - Baran et al., 15 Oct 2026) in Remark immediately following Lemma in Section 6 (The chromatic number)