The following pages link to Strict bounds for pattern avoidance (Q393106):
Displaying 13 items.
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Multiple pattern avoidance with respect to fixed points and excedances (Q1883667) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- Pattern avoidance in partial words over a ternary alphabet (Q2517160) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- New problems of pattern avoidance (Q2708964) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- A short proof that shuffle squares are 7-avoidable (Q3186679) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Tower-type bounds for unavoidable patterns in words (Q5241496) (← links)