Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_graph_edge_count__p2m_7ae41427_8c04_422e_92b9_bd045ddeec30_a1approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal among drawable supergraphs has exactly 3n − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_count__p2m_7ae41427_8c04_422e_92b9_bd045ddeec30_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) :
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).