On the Long-Repetition-Free 2-Colorability of Trees

Joseph Antonides, Claire Kiers, Nicole Yamzon

A word $\bar{w}=\bar{u}\bar{u}$ is a $long$ $square$ if $\bar{u}$ is of length at least 3; a word $\bar{w}$ is $long$-$square$-$free$ if $\bar{w}$ contains no sub-word that is a…