2IML - Institut Mathématiques de Luminy (Université de la Méditerranée Faculté des Sciences de Luminy
case 907 163, avenue de Luminy
13288 MARSEILLE CEDEX 09 - France)
Abstract : The repetition threshold introduced by Dejean and Brandenburg is the smallest real number α such that there exists an infinite word over a k-letter alphabet that avoids β-powers for all β > α. We extend this notion to colored graphs and obtain the value of the repetition thresholds of trees and "large enough" subdivisions of graphs for every alphabet size.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00739384
Contributeur : Pascal Ochem
<>
Soumis le : lundi 8 octobre 2012 - 10:30:02
Dernière modification le : mardi 30 janvier 2018 - 12:12:03
