Edge bound for connected planar graphs
ProvedWilliamsonShmoys.connected_planar_edge_upper_bound__p2m_e69ed9eb_68bb_4280_ac9e_246f714b2ccd_a1approximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with the supplied crossing-free drawing and at least three vertices has at most three times its number of vertices minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_upper_bound__p2m_e69ed9eb_68bb_4280_ac9e_246f714b2ccd_a1 {V : Type} [Fintype V] [LinearOrder V] (G : SimpleGraph V) (hG : WilliamsonShmoys.HasPlanarDrawingOn G) (hConn : G.Connected) (hCard : 3 ≤ Fintype.card V) : G.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).