Simple planar graph edge upper bound
ProvedWilliamsonShmoys.maximal_planar_card_2d69255633d74159_planar_upper_boundapproximation-algorithmsplanar-graphstreewidth
Every simply drawn planar graph on at least three vertices has at most 3|V| − 6 edges. This removes the upper-bound obligation from the parent. A proof route is to derive the planar Euler inequality from the drawing, treating connected components, and use that each face boundary has length at least three in a simple graph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_card_2d69255633d74159_planar_upper_bound
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V) (hV : 3 ≤ Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P) :
P.edgeSet.ncard ≤ 3 * Fintype.card V - 6 := 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).