Maximal planar graph edge-count lower bound
ProvedWilliamsonShmoys.maximal_planar_simple_edge_count_lower_bound_wsapproximation-algorithmsplanar-graphstreewidth
A drawable graph maximal among drawable supergraphs on the same vertex type, with at least three vertices, has at least three times its number of vertices minus six edges, written using addition to avoid truncated subtraction.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_simple_edge_count_lower_bound_ws
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hmax : ∀ N : SimpleGraph V, M <= N →
WilliamsonShmoys.HasPlanarDrawingOn N → N <= M) :
3 * Fintype.card V <= M.edgeSet.ncard + 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).