ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected finite graph of maximum degree Δ⩾1\Delta \geqslant 1. An equitable Δ\Delta-coloring is a proper coloring with Δ\Delta color classes whose sizes differ by at most 11.

Chen--Lih--Wu's conjecture. The graph GG has an equitable Δ\Delta-coloring unless one of the following holds: Δ=2\Delta=2 and GG is an odd cycle; G≅KΔ+1G \cong K_{\Delta+1}; or Δ\Delta is odd and G≅KΔ,ΔG \cong K_{\Delta,\Delta}.

This is an equitable analogue of Brooks's theorem. The conjecture remains open, and the paper studies measurable and Borel versions of related coloring results.

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.