Open Problems in Pattern Avoidance
From MaRDI portal
Publication:4293887
DOI10.2307/2324790zbMath0798.68139OpenAlexW1982787058MaRDI QIDQ4293887
Publication date: 10 July 1994
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2324790
Related Items (24)
Non-repetitive colorings of infinite sets ⋮ On the facial Thue choice number of plane graphs via entropy compression method ⋮ On the structure and extendibility of \(k\)-power free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ Exponential lower bounds for the number of words of uniform length avoiding a pattern ⋮ The complexity of unavoidable word patterns ⋮ Non-repetitive words: Ages and essences ⋮ Extended regular expressions: succinctness and decidability ⋮ Pattern avoidance on graphs ⋮ Some results in square-free and strong square-free edge-colorings of graphs ⋮ The set of \(k\)-power free words over \(\Sigma\) is empty or perfect ⋮ Words strongly avoiding fractional powers ⋮ Thue type problems for graphs, points, and numbers ⋮ Avoiding large squares in partial words ⋮ Facial non-repetitive edge-coloring of plane graphs ⋮ The Goulden—Jackson cluster method: extensions, applications and implementations ⋮ Splitting necklaces and measurable colorings of the real line ⋮ Periodicity and the golden ratio ⋮ THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE ⋮ Nonrepetitive colorings of graphs ⋮ On repetition-free binary words of minimal density ⋮ Repetitive perhaps, but certainly not boring ⋮ A generator of morphisms for infinite words ⋮ Total Thue colourings of graphs
This page was built for publication: Open Problems in Pattern Avoidance
