ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An instance of list edge-colouring consists of a graph GG and an assignment of lists L:E(G)→P(N)L:E(G)\rightarrow\mathcal{P}(\mathbb{N}), where each edge ee receives a list L(e)L(e) of colours. An LL-edge-colouring assigns to each edge ee a colour in L(e)L(e) so that adjacent edges receive different colours. The list chromatic index ch′(G)\mathrm{ch}'(G) is the smallest integer kk such that every assignment of lists of size at least kk admits an LL-edge-colouring; χ′(G)\chi'(G) denotes the chromatic index of GG. List colouring conjecture. For all graphs GG it holds that

ch′(G)=χ′(G).\mathrm{ch}'(G)=\chi'(G).

This is a central open problem in list colouring. It has been verified asymptotically by Kahn and for particular families, including bipartite graphs by Galvin, but remains open in general.

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.