On the facial Thue choice index via entropy compression

A sequence is nonrepetitive if it contains no identical consecutive subsequences. An edge colouring of a path is nonrepetitive if the sequence of colours of its consecutive edges is nonrepetitive. By the celebrated construction of Thue, it is possible to generate nonrepetitive edge colourings for arbitrarily long paths using only three colours. A recent generalization of this concept implies that we may obtain such colourings even if we are forced to choose edge colours 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', Sot\'ak and \v{S}krabul'\'akov\'a proved that for each plane graph, 8 colours are sufficient to provide an edge colouring so that every facial path is nonrepetitively coloured. In this paper 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 Lov\'asz Local Lemma). Our approach is based on the Moser-Tardos entropy-compression method and its recent extensions by Grytczuk, Kozik and Micek, and by Dujmovi\'c, Joret, Kozik and Wood

A new approach to nonrepetitive sequences

A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long nonrepetitive sequence. It is still not settled whether the following extension holds: for every sequence of 3-element sets $L_1,..., L_n$ there exists a nonrepetitive sequence $s_1, ..., s_n$ with $s_i\in L_i$. Applying the probabilistic method one can prove that this is true for sufficiently large sets $L_i$. We present an elementary proof that sets of size 4 suffice (confirming the best known bound). The argument is a simple counting with Catalan numbers involved. Our approach is inspired by a new algorithmic proof of the Lov\'{a}sz Local Lemma due to Moser and Tardos and its interpretations by Fortnow and Tao. The presented method has further applications to nonrepetitive games and nonrepetitive colorings of graphs.Comment: 5 pages, no figures.arXiv admin note: substantial text overlap with arXiv:1103.381

Online version of the theorem of Thue

A sequence S is nonrepetitive if no two adjacent blocks of S are the same. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3 symbols. We consider the online variant of this result in which a nonrepetitive sequence is constructed during a play between two players: Bob is choosing a position in a sequence and Alice is inserting a symbol on that position taken from a fixed set A. The goal of Bob is to force Alice to create a repetition, and if he succeeds, then the game stops. The goal of Alice is naturally to avoid that and thereby to construct a nonrepetitive sequence of any given length. We prove that Alice has a strategy to play arbitrarily long provided the size of the set A is at least 12. This is the online version of the Theorem of Thue. The proof is based on nonrepetitive colorings of outerplanar graphs. On the other hand, one can prove that even over 4 symbols Alice has no chance to play for too long. The minimum size of the set of symbols needed for the online version of Thue's theorem remains unknown

Majority choosability of digraphs

A \emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $D$ is \emph{majority $k$-choosable} if for any assignment of lists of colors of size $k$ to the vertices there is a majority coloring of $D$ from these lists. We prove that every digraph is majority $4$-choosable. This gives a positive answer to a question posed recently by Kreutzer, Oum, Seymour, van der Zypen, and Wood in \cite{Kreutzer}. We obtain this result as a consequence of a more general theorem, in which majority condition is profitably extended. For instance, the theorem implies also that every digraph has a coloring from arbitrary lists of size three, in which at most $2/3$ of the out-neighbors of any vertex share its color. This solves another problem posed in \cite{Kreutzer}, and supports an intriguing conjecture stating that every digraph is majority $3$-colorable

Strong chromatic index of sparse graphs

A coloring of the edges of a graph $G$ is strong if each color class is an induced matching of $G$. The strong chromatic index of $G$, denoted by $\chi_{s}^{\prime}(G)$, is the least number of colors in a strong edge coloring of $G$. In this note we prove that $\chi_{s}^{\prime}(G)\leq (4k-1)\Delta (G)-k(2k+1)+1$ for every $k$-degenerate graph $G$. This confirms the strong version of conjecture stated recently by Chang and Narayanan [3]. Our approach allows also to improve the upper bound from [3] for chordless graphs. We get that $$ for any chordless graph $G$. Both bounds remain valid for the list version of the strong edge coloring of these graphs