Simple planar edge bound for the face-count inequality
ProvedWilliamsonShmoys.connected_planar_edge_count_bound_for_face_inequalityapproximation-algorithmsplanar-graphstreewidth
A finite connected simple graph with at least three vertices and the supplied crossing-free drawing has at most 3n − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_edge_count_bound_for_face_inequality
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hPdraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hPconn : P.Connected)
(hCard : 3 ≤ Fintype.card V) :
P.edgeSet.ncard ≤ 3 * Fintype.card V - 6 := 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).