The $\mathrm{mod}k$ chromatic index of random graphs

Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa

The $\mathrm{mod}k$ chromatic index of a graph $G$ is the minimum number of colors needed to color the edges of $G$ in a way that the subgraph spanned by the edges of each color has…