Chen--Lih--Wu's equitable Brooks conjecture
Statement
Let be a connected finite graph of maximum degree . An equitable -coloring is a proper coloring with color classes whose sizes differ by at most .
Chen--Lih--Wu's conjecture. The graph has an equitable -coloring unless one of the following holds: and is an odd cycle; ; or is odd and .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.