Connected planar drawing edge-count bound
ProvedWilliamsonShmoys.connected_planar_edge_count_upper_bound__p2m_c955d1e3_af39_465d_8618_7c677be66dad_a1A connected finite simple graph on at least three vertices with a crossing-free drawing has at most 3n−6 edges. This isolates the Euler-formula and face-boundary argument from the parent theorem's disconnected case.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_count_upper_bound__p2m_c955d1e3_af39_465d_8618_7c677be66dad_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hConn : M.Connected)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hCard : 3 <= Fintype.card V) :
M.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).