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

Abstract

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-disjoint union of cycles is a trivial value $3n-6$. Lan, Shi and Song determine the exact value of $e{x}_{\mathcal{P}}(n,2C_3)$. We continue to study planar Turán number of vertex-disjoint union of cycles and obtain the exact value of $e{x}_{\mathcal{P}}(n,H)$, where $H$ is vertex-disjoint union of $C_3$ and $C_4$. The extremal graphs are also characterized. We also improve the lower bound of $e{x}_{\mathcal{P}}(n,2C_k)$ when $k$ is sufficiently large.