Local Vizing's theorem
Statement
Let be a graph with a list assignment to the edges of . For every edge , define its permissible colour list by
An -edge-colouring assigns to each edge a colour from its list so that incident edges receive distinct colours.
Local Vizing's theorem. There is an -edge-colouring of .
Vizing's theorem gives an edge-colouring from a common list of size ; this conjecture proposes the corresponding locally varying bound. The source presents it as a belief and an open question, with no resolution supplied.
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.