Simple planar graphs satisfy the edge upper bound
ProvedWilliamsonShmoys.planar_edge_upper_bound__p2m_68d7f981_8fd3_430a_af01_9cf213d6ade1_a1approximation-algorithmsplanar-graphstreewidth
For a finite simple graph on at least three vertices, a crossing-free drawing implies the usual planar edge upper bound. This supplies the Euler and face-incidence argument for the parent.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_upper_bound__p2m_68d7f981_8fd3_430a_af01_9cf213d6ade1_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V) :
G.edgeSet.ncard + 6 ≤ 3 * Fintype.card V := by sorrySource
David P. Williamson and David B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011, author electronic manuscript, Section 10.2, proof of Theorem 10.11, pp. 270-272. https://doi.org/10.1017/CBO9780511921735. Bounded tree-width of the pieces: Robertson–Seymour (planar graphs of radius r have tree-width at most 3r+1) / Bodlaender (k-outerplanar graphs have tree-width at most 3k-1).