On the Facial Thue Choice Index via Entropy Compression

A sequence is nonrepetitive if it contains no identical consecutive subsequences. An edge coloring of a path is nonrepetitive if the sequence of colors of its consecutive edges is nonrepetitive. By the celebrated construction of Thue, it is possible to generate nonrepetitive edge colorings for arbitrarily long paths using only three colors. A recent generalization of this concept implies that we may obtain such colorings even if we are forced to choose edge colors from any sequence of lists of size 4 (while sufficiency of lists of size 3 remains an open problem). As an extension of these basic ideas, Havet, Jendrol', Sotak, and Skrabul'akova proved that for each plane graph, eight colors are sufficient to provide an edge coloring so that every facial path is nonrepetitively colored. In this article, we prove that the same is possible from lists, provided that these have size at least 12. We thus improve the previous bound of 291 (proved by means of the Lovasz Local Lemma). Our approach is based on the Moser–Tardos entropy-compression method and its recent extensions by Grytczuk, Kozik, and Micek, and by Dujmovic, Joret, Kozik, and Wood.

[1]  Jeffrey Shallit,et al.  Automatic Sequences by Jean-Paul Allouche , 2003 .

[2]  Jens Schreyer,et al.  On the facial Thue choice index of plane graphs , 2012, Discret. Math..

[3]  James D. Currie,et al.  Pattern avoidance: themes and variations , 2005, Theor. Comput. Sci..

[4]  Xuding Zhu,et al.  Nonrepetitive list colourings of paths , 2011, Random Struct. Algorithms.

[5]  Stanislav Jendrol',et al.  Facial non‐repetitive edge‐coloring of plane graphs , 2011, J. Graph Theory.

[6]  Noga Alon,et al.  Nonrepetitive colorings of graphs , 2002, Random Struct. Algorithms.

[7]  Harold Marston Morse.  A One-to-One Representation of Geodesics on a Surface of Negative Curvature , 1921 .

[8]  Jaroslaw Grytczuk,et al.  New approach to nonrepetitive sequences , 2011, Random Struct. Algorithms.

[9]  David R. Wood,et al.  Nonrepetitive colouring via entropy compression , 2011, Comb..

[10]  Jarosław Grytczuk,et al.  Nonrepetitive Graph Coloring , 2006 .

[12]  Gábor Tardos,et al.  A constructive proof of the general lovász local lemma , 2009, JACM.

[13]  J'anos Bar'at,et al.  Vertex coloring of plane graphs with nonrepetitive boundary paths , 2011 .

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[16]  Jaroslaw Grytczuk,et al.  Thue type problems for graphs, points, and numbers , 2008, Discret. Math..

[17]  J. Shallit,et al.  Automatic Sequences: Frequency of Letters , 2003 .

[18]  Stanislav Jendrol',et al.  Nonrepetitive vertex colorings of graphs , 2012, Discret. Math..

[19]  Sandi Klavzar,et al.  Square-free colorings of graphs , 2004, Ars Comb..

[20]  Július Czap,et al.  Facial Nonrepetitive Vertex Coloring of Plane Graphs , 2013, J. Graph Theory.

[21]  O. Riordan,et al.  NON-REPETITIVE COLORINGS OF GRAPHS , 2002 .

[22]  Jaroslaw Grytczuk,et al.  Nonrepetitive Colorings of Graphs - A Survey , 2007, Int. J. Math. Math. Sci..

[23]  Jeffrey Shallit,et al.  Automatic Sequences: Theory, Applications, Generalizations , 2003 .

[24]  J. Shallit,et al.  Automatic Sequences: Contents , 2003 .

[25]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[26]  Erika äKRABUâÁKOVÁ,et al.  FACIAL NON-REPETITIVE EDGE COLOURING OF SEMIREGULAR POLYHEDRA , 2009 .

[27]  Wesley Pegden,et al.  Highly nonrepetitive sequences: Winning strategies from the local lemma , 2010, Random Struct. Algorithms.

[28]  Tetsuo Shibuya,et al.  Geometric suffix tree , 2010, J. ACM.