A stronger bound for the strong chromatic index

We prove for graphs of sufficiently large maximum degree where is the strong chromatic index of G. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where it is allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable.