Planar Turán number of disjoint union of $C_3$ and $C_4$

Ping Li

The {\em planar Turán number} of $H$, denoted by $e{x}_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $H$-free planar graph. The planar Turán number of $k\ge 3$ vertex-di…