Planar simple graph edge bound from a drawing
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_count_retry_646b0e38_planar_edge_boundapproximation-algorithmsplanar-graphstreewidth
Every finite simple graph with at least three vertices and a drawing satisfying the supplied planar-drawing predicate has at most 3n−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_count_retry_646b0e38_planar_edge_bound
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N) :
N.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).