Strongly equitable Ore-degree list-coloring conjecture
Statement
For a graph , define its Ore-degree by
A graph is SE -choosable if every -list assignment admits a strongly equitable list coloring. Strongly equitable Ore-degree conjecture. If
then is SE -choosable. This is proposed as the strongly equitable analogue of the Ore-degree list-coloring conjecture.
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.