Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters

DOI10.1016/j.ejc.2024.103924arXiv2107.14022OpenAlexW3187028950WikidataQ129667523 ScholiaQ129667523MaRDI QIDQ6201902

Matthieu Rosenfeld

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Game theory (91Axx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Another approach to non-repetitive colorings of graphs of bounded degree
• Highly nonrepetitive sequences: Winning strategies from the local lemma
• A constructive proof of the general lovász local lemma
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• New approach to nonrepetitive sequences
• Avoiding squares over words with lists of size three amongst four symbols