Grasshopper avoidance of patterns
From MaRDI portal
Publication:727190
zbMath1351.05007MaRDI QIDQ727190
Krzysztof Węsek, Urszula Pastwa, Michał Dębski
Publication date: 6 December 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p17
Related Items
Fractional meanings of nonrepetitiveness ⋮ On some interesting ternary formulas ⋮ Avoiding Multiple Repetitions in Euclidean Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Application of entropy compression in pattern avoidance
- Nonrepetitive colorings of line arrangements
- Pattern avoidance: themes and variations
- The origins of combinatorics on words
- Pattern avoidance on graphs
- Thue type problems for graphs, points, and numbers
- Avoidable patterns on two letters
- Avoidable patterns in strings of symbols
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Unavoidable binary patterns
- Non-repetitive tilings
- Thue-like sequences and rainbow arithmetic progressions
- On a generalization of Thue sequences
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- Doubled patterns are 3-avoidable
- Chromatic Number of the Plane & Its Relatives, History, Problems and Results: An Essay in 11 Parts
- A generator of morphisms for infinite words
- BLOCKING SETS OF TERMS
- A constructive proof of the Lovász local lemma
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
- Nonrepetitive and pattern-free colorings of the plane
