Open Problems in Pattern Avoidance
From MaRDI portal
Recommendations
Cited in
(27)- Periodicity and the golden ratio
- On repetition-free binary words of minimal density
- The set of k-power free words over is empty or perfect
- Repetitive perhaps, but certainly not boring
- Non-repetitive colorings of infinite sets
- On the structure and extendibility of \(k\)-power free words
- Non-repetitive words: Ages and essences
- Words strongly avoiding fractional powers
- The complexity of unavoidable word patterns
- Total Thue colourings of graphs
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- On the facial Thue choice number of plane graphs via entropy compression method
- Facial non-repetitive edge-coloring of plane graphs
- A generator of morphisms for infinite words
- Bad News on Decision Problems for Patterns
- Splitting necklaces and measurable colorings of the real line
- Extended regular expressions: succinctness and decidability
- scientific article; zbMATH DE number 6928767 (Why is no real title available?)
- The Goulden—Jackson cluster method: extensions, applications and implementations
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
- Avoiding large squares in partial words
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of graphs
- On the entropy and letter frequencies of powerfree words
- Pattern avoidance on graphs
- Some results in square-free and strong square-free edge-colorings of graphs
- Thue type problems for graphs, points, and numbers
This page was built for publication: Open Problems in Pattern Avoidance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4293887)
