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


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 colors suffice if the graph is bipartite. We investigate the existence of measurable edge-colorings for graphings. A graphing is an analytic generalization of a bounded-degree graph… (More)


1 Figure or Table

Cite this paper

@inproceedings{Cska2014KonigsLC, title={Kőnig’s Line Coloring and Vizing’s Theorems for Graphings}, author={Endre Cs{\'o}ka and Gabor Lippner and Oleg Pikhurko}, year={2014} }