Edge count of a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count__p2m_b5de7163_4173_4d75_853e_5e2f32ae30ae_a1approximation-algorithmsplanar-graphstreewidth
A graph maximal under planar edge addition, with at least three vertices, has exactly three times its vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_b5de7163_4173_4d75_853e_5e2f32ae30ae_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hplanar : WilliamsonShmoys.HasPlanarDrawingOn H)
(hmax : ∀ J : SimpleGraph V, H.edgeSet ⊆ J.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn J → J.edgeSet = H.edgeSet)
(hcard : 3 ≤ Fintype.card V) :
H.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).