For a planar graph H $H$ , let N P ( n ) ${{\bf{N}}}_{{\mathscr{P}}}(n,H)$ denote the maximum number of copies in an $n$ -vertex graph. In this paper, we prove that 7 ~ 4 27 ${{\bf{N}}}_{{\mathscr{P}}}(n,{P}_{7})\unicode{x0007E}\frac{4}{27}{n}^{4}$ C 6 ∕ 3 ${{\bf{N}}}_{{\mathscr{P}}}(n,{C}_{6})\unicode{x0007E}{(n\unicode{x02215}3)}^{3}$ 8 ${{\bf{N}}}_{{\mathscr{P}}}(n,{C}_{8})\unicode{x0007E}{(...