ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with maximum degree Δ≥3\Delta\ge 3. Let G2G^2 be its square, and let χℓ(G2)\chi_{\ell}(G^2) denote the list chromatic number of G2G^2. A Moore graph is a Δ\Delta-regular graph on Δ2+1\Delta^2+1 vertices such that G2=KΔ2+1G^2=K_{\Delta^2+1}.

Cranston–Kim conjecture. If GG is not a Moore graph, then

χℓ(G2)≤Δ2−1.\chi_{\ell}(G^2)\le \Delta^2-1.

The source states that Cranston and Kim proved the conjecture for Δ=3\Delta=3, while Bonamy and Bousquet proved the full claim in the more general setting of online list coloring.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.