Efficiently list-edge coloring multigraphs asymptotically optimally

Fotis Iliopoulos, Alistair Sinclair

Abstract: We give polynomial time algorithms for the seminal results of Kahn, who showed that the Goldberg–Seymour and list-coloring conjectures for (list-)edge coloring multigraphs hold asymptotically. Kahn's...