# On repetition thresholds of caterpillars and trees of bounded degree

2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph classes. In this paper, we completely determine the repetition thresholds for caterpillars and caterpillars of maximum degree $3$. Additionally, we present bounds for the repetition thresholds of trees with bounded maximum degrees.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [14 references]

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01730276
Contributor : Alexandre Pinlou <>
Submitted on : Friday, December 20, 2019 - 2:08:21 PM
Last modification on : Wednesday, November 4, 2020 - 6:08:04 PM
Long-term archiving on: : Saturday, March 21, 2020 - 5:25:19 PM

### File

1702.01058v1.pdf
Files produced by the author(s)

### Citation

Borut Lužar, Pascal Ochem, Alexandre Pinlou. On repetition thresholds of caterpillars and trees of bounded degree. The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.61. ⟨lirmm-01730276⟩

Record views