Extend a planar drawing to a triangulation with the maximal edge count
ProvedWilliamsonShmoys.planar_triangulation_extensionapproximation-algorithmsplanar-graphstreewidth
Every planar graph on a finite ordered vertex type with at least three vertices has a planar supergraph on the same vertices whose edge count is exactly 3n−6. This is the augmentation-and-counting step used by the parent.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_triangulation_extension
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V) :
∃ H : SimpleGraph V,
(∀ ⦃u v : V⦄, K.Adj u v → H.Adj u v) ∧
WilliamsonShmoys.HasPlanarDrawingOn H ∧
H.edgeSet.ncard = 3 * Fintype.card V - 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).