Tower-type bounds for unavoidable patterns in words

DOI10.1090/tran/7751zbMath1431.68102arXiv1704.03479OpenAlexW2963513732MaRDI QIDQ5241496

Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 31 October 2019

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.03479

zbMATH Keywords

local lemmacombinatorics on wordsavoidanceZimin word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

The complexity of unavoidable word patterns, On long words avoiding Zimin patterns

Cites Work

• Unnamed Item
• Unnamed Item
• The origins of combinatorics on words
• Avoidable patterns in strings of symbols
• Searching for Zimin patterns
• Recent developments in graph Ramsey theory
• On Long Words Avoiding Zimin Patterns
• Combinatorial Algebra: Syntax and Semantics
• Bounds on Zimin Word Avoidance
• THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
• Magical Mathematics