An Optimal Lower Bound For The Size Of Periodic Digraphs

A periodic digraph is the digraph associated with a periodic point of a continuous map from the unit interval to itself. This digraph encodes “covering” relation between minimal intervals in the corresponding orbit, which allows the application of purely combinatorial arguments in establishing results on the existence and co-existence of periods of periodic points (for example, in proving the famous Sharkovsky’s theorem). In this article, an optimal lower bound for the size of periodic digraphs is provided and thus some previous results of Pavlenko are tightened.