List Colouring Conjecture
Statement
Let be a graph of maximum degree . Let denote its edge set, and let be a list assignment assigning a set of colours to each edge of . An -colouring is a proper edge-colouring in which the colour assigned to each edge belongs to .
List Colouring Conjecture. If is a graph of maximum degree and is a list assignment to such that
for every edge of , then there exists an -colouring of the edges of .
This is the edge-colouring list analogue of the chromatic index bound, and the paper describes it as a conjecture connected to linear arboricity. The supplied text gives no resolution status for this conjecture.
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.