• Corpus ID: 15142067

Entropy compression method applied to graph colorings

  title={Entropy compression method applied to graph colorings},
  author={Daniel Gonçalves and Micka{\"e}l Montassier and Alexandre Pinlou},
Based on the algorithmic proof of Lov\'asz local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmovi\'c et al. on colorings, Esperet and Parreau developed a framework to prove upper bounds for several chromatic numbers (in particular acyclic chromatic index, star chromatic number and Thue chromatic number) using the so-called \emph{entropy compression method}. Inspired by this work, we propose a more general framework and a better analysis. This leads to improved… 

Tables from this paper

Another approach to non-repetitive colorings of graphs of bounded degree
  • M. Rosenfeld
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2020
A new proof technique is proposed that applies to the same problems as the Lovász Local Lemma or the entropy-compression method and is used to improve upper-bounds relating different non-repetitive chromatic numbers to the maximal degree of a graph.
Acyclic edge coloring through the Lovász Local Lemma
Coloring Graphs Without Bichromatic Cycles or Paths
Let $$k\ge 4$$ be an integer, and let G be a graph with maximum degree $$\Delta $$ . In 1991, Alon, McDiarmid and Reed proved that G has a proper coloring using $$O(\Delta ^{(k-1)/(k-2)})$$
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
An alternative probabilistic analysis of the Lovasz Local Lemma algorithm is presented that does not involve reconstructing the history of the algorithm from the witness tree, and the technique is applied to improve the best known upper bound to acyclic chromatic index.
The Thue choice number versus the Thue chromatic number of graphs
We say that a vertex colouring $\varphi$ of a graph $G$ is nonrepetitive if there is no positive integer $n$ and a path on $2n$ vertices $v_{1}\ldots v_{2n}$ in $G$ such that the associated sequence
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length.
The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of a fixed family of subgraphs has been widely studied. Most well-known examples
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of a fixed family of subgraphs has been widely studied. Most well-known examples
Entropy Compression Method and Legitimate Colorings in Projective Planes
We prove that the entropy compression method systematized by L. Esperet and A. Parreau [10] can be applied to any problem formulated in the variable version of the Lov\'asz Local Lemma. As an
New Trends in Graph Coloring
Graph coloring is one of the oldest studied topics in graph theory. Its roots date back to 1852 with the first statement of the celebrated Four Color Conjecture: can the countries of any map on a
Backtracking and Commutative Algorithms for the LLL
This work extends the framework of Achlioptas and Iliopoulos~\cite{AI} and provides a Local Lemma criterion that can capture every application of backtracking algorithms the authors are aware of and more and shows that for commutative algorithms, the witness tree lemma holds.


Acyclic edge-coloring using entropy compression
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method
The so-called entropy compression method is used to show thatπfl(G)≤cΔ for some absolute constant c and G a plane graph with maximum degree Δ and some better upper bounds onπfl (G) for special classes of plane graphs are given.
Coloring with no 2-Colored P4's
It is shown that every acyclic $k-coloring can be refined to a star coloring with at most $(2k^2-k)$ colors, and it is proved that planar graphs have star colorings with at least 20 colors and a planar graph which requires 10 colors is exhibited.
Nonrepetitive colouring via entropy compression
The proofs of both these results are based on the Moser-Tardos entropy-compression method, and a recent extension by Grytczuk, Kozik and Micek for the nonrepetitive choosability of paths.
On the Facial Thue Choice Index via Entropy Compression
This article proves that for each plane graph, eight colors are sufficient to provide an edge coloring so that every facial path is nonrepetitively colored, and improves the previous bound of 291.
Bounds on vertex colorings with restrictions on the union of color classes
This paper considers proper colorings in which the union of any j color classes induces a subgraph which has no copy of any member of ℱ, and obtains upper bounds on the minimum number of colors sufficient to obtain such a coloring.
Nonrepetitive colorings of graphs
This paper considers a natural generalization of Thue's sequences for colorings of graphs and shows that the Thue number stays bounded for graphs with bounded maximum degree, in particular, π (G) ≤ cΔ(G)2 for some absolute constant c.
Star coloring of graphs
The exact value of the star chromatic number of different families of graphs, such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids, is given.
The generalized acyclic edge chromatic number of random regular graphs
It is shown that (r − 2)d is asymptotically almost surely (a.a.s.) an upper bound on the r-acyclic edge chromatic number of a random d-regular graph, for all constants r ≥ 4 and d ≥ 2.