Edge bound for a drawn simple planar graph
ProvedWilliamsonShmoys.connected_simple_planar_edge_bound__p2m_2c120eb1_ceed_4c13_9974_ca3513a96318_a1approximation-algorithmsplanar-graphstreewidth
A connected simple graph on at least three vertices with the supplied planar drawing has at most three times its vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_simple_planar_edge_bound__p2m_2c120eb1_ceed_4c13_9974_ca3513a96318_a1 {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hConn : H.Connected) (hDraw : HasPlanarDrawingOn H) (hCard : 3 <= Fintype.card V) : H.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).