ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an equitable kk-coloring be a proper kk-coloring whose color classes have sizes differing by at most one, and let d(x)d(x) denote the degree of a vertex xx. Kierstead-Kostochka conjecture. For k≥3k≥3, if GG is a graph satisfying d(x)+d(y)≤2kd(x)+d(y)≤2k for every edge xyxy, and GG has no equitable kk-coloring, then GG contains either Kk+1K_{k+1} or Km,2k−mK_{m,2k-m} for some odd mm.

This is the Ore-type analogue of the Chen-Lih-Wu Conjecture. The paper proves it when kk is at least a fixed positive proportion of the number of vertices, while the case k=o(n)k=o(n) 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 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.