Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.edge_count_of_maximal_completion_repairapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that has no strictly larger drawable supergraph has exactly 3|V| − 6 edges. The proof formalizes the maximal planar graph argument: maximality forces connectedness and triangular faces, after which Euler’s formula and counting face-edge incidences yield the equality. The lower bound is essential to the edge-count claim and includes the three-vertex complete-graph boundary case.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_count_of_maximal_completion_repair
{V : Type} [Fintype V] [LinearOrder V]
(W : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hW : WilliamsonShmoys.HasPlanarDrawingOn W)
(hmax : ∀ U : SimpleGraph V,
W ≤ U → WilliamsonShmoys.HasPlanarDrawingOn U → U ≤ W) :
3 * Fintype.card V = W.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).