Connected planar edge count upper bound
ProvedWilliamsonShmoys.connected_planar_edge_count_upper_bound__p2m_4a772063d306_45bd_a029_619aef07cba4_a11approximation-algorithmsplanar-graphstreewidth
A finite connected simple graph with a HasPlanarDrawingOn drawing and at least three vertices has at most 3|V| − 6 edges. This isolates the Euler and face-incidence argument; an independent route is an embedding, Euler's formula, two incidences per edge (including bridges), and the minimum face-length count.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_count_upper_bound__p2m_4a772063d306_45bd_a029_619aef07cba4_a11
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V)
(hT : WilliamsonShmoys.HasPlanarDrawingOn T)
(hConnected : T.Connected)
(hV : 3 ≤ Fintype.card V) :
T.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).