Kőnig's Line Coloring and Vizing's Theorems for Graphings

Endre Csóka, Gabor Lippner, Oleg Pikhurko

The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge-coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by Kőnig, $d$…