Planar edge-count upper bound
ProvedWilliamsonShmoys.planar_edge_count_upper_bound_from_drawing__p2m_9b9fadfe_20c3_484e_b25c_37db0802734a_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph with at least three vertices has at most 3n−6 edges. This supplies the target’s upper bound; a proof can use Euler’s formula after connecting components in the drawing and counting at least three edge occurrences per face.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound_from_drawing__p2m_9b9fadfe_20c3_484e_b25c_37db0802734a_a1 {V : Type} [Fintype V] [LinearOrder V] (S : SimpleGraph V) (hS : WilliamsonShmoys.HasPlanarDrawingOn S) (hCard : 3 ≤ Fintype.card V) : S.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).