Vizing’s list edge-colouring conjecture
Statement
For every loopless multigraph , the list edge-chromatic number equals the edge-chromatic number: . Equivalently, if each edge of is assigned a list of at least colors, then has a proper edge coloring choosing for each edge a color from its list.
Record
- Added
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.