New approach to nonrepetitive sequences
From MaRDI portal
Publication:4909201
DOI10.1002/rsa.20411zbMath1349.68131arXiv1103.3809OpenAlexW3123973497MaRDI QIDQ4909201
Jakub Kozik, Piotr Micek, Jarosław Grytczuk
Publication date: 12 March 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.3809
2-person games (91A05) Combinatorics on words (68R15) Games involving topology, set theory, or logic (91A44) Combinatorial aspects of tessellation and tiling problems (05B45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Thue and Post systems, etc. (03D03)
Related Items
Fractional meanings of nonrepetitiveness ⋮ On the facial Thue choice number of plane graphs via entropy compression method ⋮ The list chromatic number of graphs with small clique number ⋮ A short proof that shuffle squares are 7-avoidable ⋮ A note on Thue games ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ New bounds for facial nonrepetitive colouring ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Approaching repetition thresholds via local resampling and entropy compression ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ Extensions and reductions of squarefree words ⋮ Edge colorings avoiding patterns ⋮ On triangle-free list assignments ⋮ Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ How far away must forced letters be so that squares are still avoidable? ⋮ Acyclic edge-coloring using entropy compression ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Generalized arboricity of graphs with large girth ⋮ Pathwidth and nonrepetitive list coloring ⋮ Every plane graph is facially-non-repetitively \(C\)-choosable ⋮ Anagram-free graph colouring ⋮ Improved Bounds for Centered Colorings ⋮ Nonrepetitive colouring via entropy compression ⋮ Entropy compression versus Lovász local lemma ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ Nonrepetitive list colorings of the integers ⋮ Pattern avoidance in partial words over a ternary alphabet ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Total Thue colourings of graphs ⋮ How to play Thue games ⋮ The local cut lemma
Cites Work
- Thue choosability of trees
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of graphs -- a survey
- Thue type problems for graphs, points, and numbers
- Nonrepetitive colorings of graphs of bounded tree-width
- Avoidable patterns in strings of symbols
- Every planar graph is 5-choosable
- Highly nonrepetitive sequences: Winning strategies from the local lemma
- Nonrepetitive list colourings of paths
- On square-free vertex colorings of graphs
- A constructive proof of the general lovász local lemma
- Automatic Sequences
- Nonrepetitive colorings of graphs
This page was built for publication: New approach to nonrepetitive sequences
