The palette-index conjecture for simple graphs
Statement
Let be a simple graph, and let denote its maximum degree. The palette-index conjecture asserts that
Previous results and sporadic examples suggest that the palette index should admit a linear upper bound in the maximum degree; this conjecture gives the stronger proposed bound.
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.