List Erdős–Neumann-Lara conjecture
Statement
Let be a graph. Its list chromatic number is the least integer such that every assignment of lists of colours to the vertices admits a proper list colouring. For an orientation of , define its list dichromatic number analogously, using list colourings in which every colour class induces an acyclic digraph, and let
where the maximum is over all orientations of .
List Erdős–Neumann-Lara conjecture. For every integer there is an integer such that, for every graph , implies .
The paper states that it proves this list version of the Erdős–Neumann-Lara conjecture, so the claim is resolved by the source's results.
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.