A linear-time algorithm for $(1+\hat{I}\mu )\hat{I}”$-edge-coloring

Anton Bernshteyn, Abhishek Dhawan

We present a randomized algorithm that, given a constant $\hat{I}\mu >0$, outputs a proper $(1+\hat{I}\mu )\hat{I}”$-edge-coloring of an $m$-edge simple graph $G$ of maximum degree $\hat{I}”\ge 1/\hat{I}\mu$ in $O(m)…