Maximal planar drawing edge lower bound
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_lower_bound__p2m_017fa3bd_a11a_42f0_a60e_fe3ebb157a5f_a1approximation-algorithmsplanar-graphstreewidth
An edge-maximal graph with the supplied planar drawing and at least three vertices has at least 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_lower_bound__p2m_017fa3bd_a11a_42f0_a60e_fe3ebb157a5f_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hM : HasPlanarDrawingOn M)
(hV : 3 ≤ Fintype.card V)
(hMmax : ∀ N : SimpleGraph V, M ≤ N → HasPlanarDrawingOn N → N ≤ M) :
(letI : DecidableRel M.Adj := Classical.decRel M.Adj;
3 * Fintype.card V ≤ M.edgeFinset.card + 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).