Maximal drawable graph edge-count lower bound
ProvedWilliamsonShmoys.maximal_planar_edge_count_lower_bound_35554814_repair3approximation-algorithmsplanar-graphstreewidth
An inclusion-maximal drawable simple graph on at least three vertices has at least 3|V| − 6 edges. Extend its planar drawing to a maximal plane graph on the same vertices; the supplied maximality forces the extension to be the original graph, so triangulation and Euler’s formula give the bound. For three vertices, maximality forces the triangle.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_lower_bound_35554814_repair3
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P)
(hMax : ∀ Q : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn Q →
Set.Subset P.edgeSet Q.edgeSet → Set.Subset Q.edgeSet P.edgeSet) :
3 * Fintype.card V ≤ P.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).