EXISTENCE OF AN INFINITE WORD WITH A RAUZY GRAPH SEQUENCE THAT CONTAINS A SUBSEQUENCE OF HOMEOMORPHS OF GRAPHS OF THE GIVEN SEQUENCE.
We investigate infinite words on a finite alphabet and prove that for any sequence of strongly connected directed graphs with maximal in and out vertices degrees that are equal to <i>s</i> there exists a uniformly recurrent infinite word on a <i>s</i>-letters alphabet with a Rauzy graph sequence that contains a subsequence of homeomorphs of graphs of the given sequence. Bibl. 5.