Maximal drawable graphs meet the planar edge lower bound
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_lower_bound__p2m_a6f95464_e388_4a5e_9ab8_247431a72b86_a1approximation-algorithmsplanar-graphstreewidth
An inclusion maximal drawable simple graph on at least three vertices has at least 3|V|−6 edges. In a maximal drawing every face is triangular (including the cases handled by the planar embedding argument); counting face-edge incidences together with Euler’s formula yields the edge bound. This child carries the main topological and planar counting work.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_lower_bound__p2m_a6f95464_e388_4a5e_9ab8_247431a72b86_a1
{V : Type} [Fintype V] [LinearOrder V] (M : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hMax : ∀ N : SimpleGraph V, M ≤ N →
WilliamsonShmoys.HasPlanarDrawingOn N → N ≤ M) :
3 * Fintype.card V - 6 ≤ M.edgeSet.ncard := 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).