ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with a list assignment LL to the edges of GG. For every edge e=uve=uv, define its permissible colour list by

L(e)=max⁡{1,…,max⁡{deg⁡(u),deg⁡(v)}+1}.L(e)=\max\{1,\dots,\max\{\deg(u),\deg(v)\}+1\}.

An LL-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 LL-edge-colouring of GG.

Vizing's theorem gives an edge-colouring from a common list of size Δ(G)+1\Delta(G)+1; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.