Euler edge bound for a finite planar drawing
ProvedWilliamsonShmoys.planar_drawing_edge_bound__p2m_d5ec0378_40af_49f0_96a5_235e13fa397b_a3approximation-algorithmsplanar-graphstreewidth
A finite simple graph on at least three vertices with an injective, crossing-free drawing as specified by HasPlanarDrawingOn has at most 3 * card V - 6 edges. This is the Euler edge bound and remains valid when the graph is disconnected.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_bound__p2m_d5ec0378_40af_49f0_96a5_235e13fa397b_a3
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hU : WilliamsonShmoys.HasPlanarDrawingOn U) :
U.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).