Kierstead-Kostochka Ore-type analogue of the Chen-Lih-Wu Conjecture
Statement
Let an equitable -coloring be a proper -coloring whose color classes have sizes differing by at most one, and let denote the degree of a vertex . Kierstead-Kostochka conjecture. For , if is a graph satisfying for every edge , and has no equitable -coloring, then contains either or for some odd .
This is the Ore-type analogue of the Chen-Lih-Wu Conjecture. The paper proves it when is at least a fixed positive proportion of the number of vertices, while the case remains a stated direction for future work.
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.