A stronger bound for the strong chromatic index

Abstract

We prove s'(G)≤ 1.93 (G)2 for graphs of sufficiently large maximum degree where s'(G) 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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…