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

Luyi Li, Ping Li, Guiying Yan +1

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