Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
T. Slivnik · Combinatorics Probability Computing · 1996
Recently, Galvin [7] proved that every k-edge-colourable bipartite multigraph is k-edge-choosable. In particular, for a bipartite multigraph G, . Here we give a brief self-contained proof of this result.