The list colouring conjecture for chromatic index
Statement
An instance of list edge-colouring consists of a graph and an assignment of lists , where each edge receives a list of colours. An -edge-colouring assigns to each edge a colour in so that adjacent edges receive different colours. The list chromatic index is the smallest integer such that every assignment of lists of size at least admits an -edge-colouring; denotes the chromatic index of . List colouring conjecture. For all graphs it holds that
This is a central open problem in list colouring. It has been verified asymptotically by Kahn and for particular families, including bipartite graphs by Galvin, but remains open in general.
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.