Papex

Open problem · Mathematics · Open

List colouring conjecture

If each edge of a graph has a list of allowed colours, as many as an ordinary edge colouring of the graph needs, can edges that meet always get different colours from their lists?

Summary

The conjecture says that a graph’s list chromatic index always equals its chromatic index; its origin is unclear. Fred Galvin proved it for bipartite graphs in 1995, which settled the Dinitz conjecture on complete bipartite graphs, and Jeff Kahn showed in 2000 that the two numbers agree asymptotically.

Source

Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics