Set
Their covering graph is
with adjacency matrix
The closed walks and give a horseshoe from two closed covering walks for , so must be chaotic. Since
counting cycles in an interval covering graph gives
distinct 3-cycles in the minimum case, attained by the corresponding connect-the-dots interval map.

Articles by others on the same topic (0)

There are currently no matching articles.