The list-chromatic index is the least integer such that every assignment of at least allowed colors to each edge admits a list edge coloring. Uniform identical lists show it is at least the chromatic index. The Galvin theorem for bipartite list edge coloring gives equality for bipartite graphs.
New to topics? Read the docs here!