Sublogarithmic randomized Vizing coloring

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

Background

The paper discusses randomized distributed algorithms for edge coloring with Δ+1 colors and notes that the best known complexity remains above the desired sublogarithmic regime.

References

Is the randomized LOCAL complexity of Vizing coloring $o(\log(n))$?

— From descriptive to distributed  (2502.15347 - Grebík et al., 21 Feb 2025) in Problem 1, Section 7 (Edge colorings)