Pages that link to "Item:Q4293887"
From MaRDI portal
The following pages link to Open Problems in Pattern Avoidance (Q4293887):
Displayed 24 items.
- On the facial Thue choice number of plane graphs via entropy compression method (Q293650) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Some results in square-free and strong square-free edge-colorings of graphs (Q879399) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Non-repetitive colorings of infinite sets (Q1874373) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- Total Thue colourings of graphs (Q2340970) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- Splitting necklaces and measurable colorings of the real line (Q3625532) (← links)
- The Goulden—Jackson cluster method: extensions, applications and implementations (Q4700080) (← links)
- THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE (Q5483466) (← links)
- Nonrepetitive colorings of graphs (Q5899395) (← links)