Euler edge bound for connected planar drawings
ProvedWilliamsonShmoys.connected_planar_drawing_edge_bound_v2approximation-algorithmsplanar-graphstreewidth
A connected finite simple graph with at least three vertices and a planar drawing has at most 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.connected_planar_drawing_edge_bound_v2
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hconn : K.Connected)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) :
K.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).