Edge count of an inclusion-maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count_for_edge_bound_50a3c5c3approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that has no strictly larger drawable supergraph on the same vertices has exactly 3n−6 edges. The proof obligation is the topological maximal-planar edge-count result: establish connectedness and triangular faces from maximality, then apply Euler’s formula.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_for_edge_bound_50a3c5c3
{V : Type} [Fintype V] [LinearOrder V]
(Q : SimpleGraph V)
(hQdraw : WilliamsonShmoys.HasPlanarDrawingOn Q)
(hCard : 3 ≤ Fintype.card V)
(hQmax : ∀ R : SimpleGraph V,
Q ≤ R → WilliamsonShmoys.HasPlanarDrawingOn R → R ≤ Q) :
Q.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).