Sublogarithmic randomized LOCAL Vizing coloring

Determine whether the randomized LOCAL complexity of edge coloring with the Vizing bound of Δ+1 colors is o(log(n)) on graphs of maximum degree Δ.

Background

The paper presents randomized distributed algorithms for Vizing coloring with polylogarithmic complexity and matching Ω(log log(n)) lower bounds. It identifies whether the complexity can be reduced below logarithmic time as the main unresolved distributed-computing problem for Vizing colorings.