List edge coloring conjecture
Statement
Let be a finite loopless graph (multiple edges permitted). Two edges are adjacent if they share an endpoint.
A proper edge coloring of with color set is a map such that whenever and are adjacent. The chromatic index is the least integer for which there is a proper edge coloring of using a color set of size .
A list assignment for is a map assigning to each edge a finite set of colors. A proper -edge-coloring of is a map with for every and for every pair of adjacent edges . For an integer , the graph is -edge-choosable if every list assignment with for all admits a proper -edge-coloring. The list chromatic index is the least such that is -edge-choosable.
Then for every such graph ,
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.