Edge bound for a maximal planar drawing
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_bound__p2m_34be30da_42b8_40a1_89e9_f0ba3aa7e7d4_a1approximation-algorithmsplanar-graphstreewidth
An inclusion-maximal drawable simple graph on at least three vertices has at least 3n − 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_bound__p2m_34be30da_42b8_40a1_89e9_f0ba3aa7e7d4_a1 {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hH : HasPlanarDrawingOn H) (hCard : 3 ≤ Fintype.card V) (hmax : ∀ K : SimpleGraph V, H ≤ K → HasPlanarDrawingOn K → K = H) : 3 * Fintype.card V - 6 ≤ H.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).