Get access

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

Authors


  • Contract grant sponsor: Illinois State University.

Abstract

For a multigraph G, the integer round-up inline image of the fractional chromatic index inline image provides a good general lower bound for the chromatic index inline image. For an upper bound, Kahn 1996 showed that for any real inline image there exists a positive integer N so that inline image whenever inline image. We show that for any multigraph G with order n and at least one edge, inline image). This gives the following natural generalization of Kahn's result: for any positive reals inline image, there exists a positive integer N so that inline image + c inline image whenever inline image. We also compare the upper bound found here to other leading upper bounds.

Ancillary