Counting $k$-cycles in $5$-connected planar triangulations

Gyaneshwar Agrahari, Xiaonan Liu, Zhiyu Wang

We show that every $n$-vertex $5$-connected planar triangulation has at most $9n-50$ many cycles of length $5$ for all $n\ge 20$ and this upper bound is tight. We also show that fo…