On the number of edges in saturated partial embeddings of maximal planar graphs

Abstract: We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}<em>{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane subgraph of $G$ such that the addition of any edge either violates planarity or results in a graph that is not a subgraph of $G$. We focus on maximal planar graphs and establish an upper bound on $\mathrm{sat}</em>{\mathcal{P}}(G)$ by showing there exists a universal constant $\epsilon &gt; 0$ such that $\mathrm{sat}<em>{\mathcal{P}}(G) &lt; (3-\epsilon)v(G)$ for any maximal planar graph $G$ with $v(G) \geq 16$. This answers a question posed by Clifton and Simon. Additionally, we derive lower bound results and demonstrate that for maximal planar graphs with sufficiently large number of vertices, the minimum ratio $\mathrm{sat}</em>{\mathcal{P}}(G)/e(G)$ lies within the interval $(1/16, 1/9 + o(1)]$.