Spectral decomposition, periods of cycles and a conjecture of M. Misiurewicz for graph maps (Q4026036)

[For the entire collection see Zbl 0744.00035.] Let \(f: X\to X\) be a continuous graph map. Using a spectral decomposition of the limit set \(\omega(f)=\bigcup\{\omega(x):x\in X\}\) the author verifies the following Misiurewicz conjecture: there exists an integer \(L\) (depending on the graph) such that if \(\{1,\dots,L\}\subset P(f)\), then \(P(f)=\mathbb{N}\). Here, \(P(f)\) denotes all periods of cycles of \(f\). Then, he proves that the following two conditions are equivalent: (1) The map \(f\) has positive entropy. (2) There exists \(n\) such that \(P(f)\) contains all integers of the form \(kn\), \(k\in \mathbb{N}\).