Edge count of a maximal drawable supergraph
ProvedWilliamsonShmoys.planar_triangulation_supergraph_edge_count_maximalEvery finite graph with a crossing-free drawing and at least three vertices has a drawable supergraph on the same vertex set with exactly 3|V| − 6 edges. The hypotheses cover the small boundary case needed for triangulation. Prove this by choosing an edge-maximal drawable supergraph, showing its drawing is connected with triangular faces, and applying Euler’s formula and face-edge incidence counting. This isolates the augmentation and planar counting argument from the parent; formalizing those facts for HasPlanarDrawingOn remains the core work.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_triangulation_supergraph_edge_count_maximal
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn G)
(hCard : 3 ≤ Fintype.card V) :
∃ L : SimpleGraph V,
G.edgeSet ⊆ L.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn L ∧
3 * Fintype.card V = L.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).