ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥2k\geq2 be a fixed positive integer and let GG be a graph. (k)(k)-total coloring conjecture.

χ”(G)≤Δ(G)+k.\chi”(G)\leq\Delta(G)+k.

This is presented as a weaker version of the total coloring conjecture obtained by relaxing the upper bound. The case k=2k=2 is the original total coloring conjecture, while larger kk give weaker assertions; the supplied text does not indicate a resolution of this general formulation.

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.