The Maximum Number of Paths of Length Four in a Planar Graph

Debarun Ghosh, Ervin Győri, Ryan R. Martin +4

Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{…