Edge count of a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count__p2m_301f4675_a625_4f03_8421_053f86d64c99_a1approximation-algorithmsplanar-graphstreewidth
A finite simple graph with at least three vertices that is maximal among graphs admitting the supplied crossing-free drawing has exactly 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_301f4675_a625_4f03_8421_053f86d64c99_a1
{V : Type} [Fintype V] [LinearOrder V] (G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V) (hG : HasPlanarDrawingOn G)
(hmax : ∀ K : SimpleGraph V, G ≤ K → HasPlanarDrawingOn K → K = G) :
3 * Fintype.card V = G.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).