On Unavoidable Sets of Word Patterns

DOI10.1137/S0895480104445678zbMath1088.05002arXivmath/0311399MaRDI QIDQ5470765

Alexander Burstein, Sergey Kitaev

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Stirling numbers of the second kindde Bruijn graphuniversal cycles(un)avoidability

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (3)

Introduction to partially ordered patterns ⋮ On uniquely \(k\)-determined permutations ⋮ Density dichotomy in random words

This page was built for publication: On Unavoidable Sets of Word Patterns