The (k)-total coloring conjecture
Statement
Let be a fixed positive integer and let be a graph. -total coloring conjecture.
This is presented as a weaker version of the total coloring conjecture obtained by relaxing the upper bound. The case is the original total coloring conjecture, while larger 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.