Drawable simple graphs satisfy the planar edge bound
ProvedWilliamsonShmoys.drawable_edge_count_upper_boundapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has at most 3|V|−6 edges. This is the Euler-count half of the argument. A proof route is to handle connected components, apply Euler’s formula to a planar embedding, and use simplicity to bound face boundary lengths, with the three-vertex boundary case treated explicitly. The hypothesis n≥3 is needed for this simple-graph bound.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_edge_count_upper_bound
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hU : WilliamsonShmoys.HasPlanarDrawingOn U) :
U.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).