Planar drawing edge upper bound
ProvedWilliamsonShmoys.connected_planar_drawing_edge_upper_bound_face_count_data_planar_edge_boundapproximation-algorithmsplanar-graphstreewidth
A finite connected simple graph with at least three vertices and the supplied crossing-free drawing has at most 3n - 6 edges. This is the substantive planar-topology step: convert the drawing data into a plane embedding, then derive the standard simple planar graph bound from Euler's formula and face-boundary counts, or triangulate while preserving the vertex set. The bound is sharp at the triangular boundary n = 3; connectedness and the vertex lower bound are retained as hypotheses. This child carries the remaining core obligation rather than restating the parent.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_drawing_edge_upper_bound_face_count_data_planar_edge_bound
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hconn : K.Connected) :
K.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).