Skip to Main content Skip to Navigation
Journal articles

Acyclic edge-coloring using entropy compression

Louis Esperet 1 Aline Parreau 2
1 G-SCOP_OC - Optimisation Combinatoire
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : An edge-coloring of a graph G is acyclic if it is a proper edge-coloring of G and every cycle contains at least three colors. We prove that every graph with maximum degree Delta has an acyclic edge-coloring with at most 4 Delta - 4 colors, improving the previous bound of 9.62 (Delta - 1). Our bound results from the analysis of a very simple randomised procedure using the so-called entropy compression method. We show that the expected running time of the procedure is O(mn Delta^2 log Delta), where n and m are the number of vertices and edges of G. Such a randomised procedure running in expected polynomial time was only known to exist in the case where at least 16 Delta colors were available. Our aim here is to make a pedagogic tutorial on how to use these ideas to analyse a broad range of graph coloring problems. As an application, also show that every graph with maximum degree Delta has a star coloring with 2 sqrt(2) Delta^{3/2} + Delta colors.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00843770
Contributor : Louis Esperet <>
Submitted on : Friday, July 12, 2013 - 10:15:36 AM
Last modification on : Wednesday, July 28, 2021 - 3:10:04 AM

Links full text

Identifiers

Citation

Louis Esperet, Aline Parreau. Acyclic edge-coloring using entropy compression. European Journal of Combinatorics, Elsevier, 2013, 34 (6), pp.1019-1027. ⟨10.1016/j.ejc.2013.02.007⟩. ⟨hal-00843770⟩

Share

Metrics

Record views

819