An edge-maximal planar graph meets the triangulation lower bound
ProvedWilliamsonShmoys.maximal_planar_supergraph_edge_bound_a11205c3_51bf_4409_a8f2_455e7e17d8d2approximation-algorithmsplanar-graphstreewidth
A planar graph on at least three vertices with no proper planar supergraph on the same vertices has at least edges. The intended route is to establish connectedness and triangular faces from maximality, then apply Euler’s formula and count face-edge incidences.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_edge_bound_a11205c3_51bf_4409_a8f2_455e7e17d8d2
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ L : SimpleGraph V,
(∀ ⦃u v : V⦄, K.Adj u v → L.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn L →
(∀ ⦃u v : V⦄, L.Adj u v → K.Adj u v)) :
3 * Fintype.card V - 6 ≤ K.edgeSet.ncard := 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).