The maximum number of two 4-vertex graphs in planar graphs

Wei Liu, Lin Sun, Jianliang Wu

Let $f(n,H)$ be the maximum number of copies of a graph $H$ in a planar graph of order $n$. When $H$ is a connected graph on four vertices, $f(n,H)$ has been completely determined…