No Detail Found!

An optimal lower bound for the size of periodic digraphs

Author(s)
Sergiy Kozerenko Faculty of Computer Sciences, National University of Kyiv-Mohyla Academy,Skovorody Str. 2, Kyiv,Ukraine
Abstract
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.
Publication Details
Page(s) 29-33
Published Journal: Discrete Mathematics Letters, Volume: 12, Issue: 0, Year: 2023

Request the full text from PASTIC

Keywords
Markov graph, periodic digraph, Sharkovsky's theorem
0

Citations

0

Downloads

36

Views