Euler edge bound for a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_bound_for_supergraph_562ccfc8approximation-algorithmsplanar-graphstreewidth
A planar graph on at least three vertices that is maximal among planar supergraphs on the same vertex type satisfies the Euler edge bound. A proof route is to establish connectedness and triangular faces from maximality, then apply Euler’s formula and count edge-face incidences. The vertex lower bound is retained explicitly because it is needed for this maximal-planar conclusion.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_bound_for_supergraph_562ccfc8
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hmax : ∀ L : SimpleGraph V,
K ≤ L → WilliamsonShmoys.HasPlanarDrawingOn L → L ≤ K) :
3 * Fintype.card V ≤ K.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).