Edge count of a maximal drawable graph
OpenWilliamsonShmoys.maximal_planar_edge_count__p2m_94636b31_2f9e_4256_93d0_7a9950cdcd71_a1approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that is maximal among drawable supergraphs on the same vertex set has exactly 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_94636b31_2f9e_4256_93d0_7a9950cdcd71_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V) [DecidableRel H.Adj]
(hH : HasPlanarDrawingOn H)
(hcard : 3 ≤ Fintype.card V)
(hmax : ∀ (K : SimpleGraph V) [DecidableRel K.Adj],
HasPlanarDrawingOn K → H ≤ K → K ≤ H) :
H.edgeFinset.card + 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).