Triangulated planar extension on the same vertices
ProvedWilliamsonShmoys.planar_triangulation_extension__p2m_fcf1b814_7848_4586_9efd_023714441148_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite linearly ordered vertex type with at least three vertices has a drawable supergraph on the same vertices whose edge set contains the original edge set and has exactly 3|V|−6 edges. This is the classical extension to a maximal planar triangulation, expressed using the project’s drawing predicate.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_triangulation_extension__p2m_fcf1b814_7848_4586_9efd_023714441148_a1
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V) (dT : DecidableRel T.Adj)
(hT : HasPlanarDrawingOn T)
(hn : 3 ≤ Fintype.card V) :
∃ (U : SimpleGraph V) (dU : DecidableRel U.Adj),
HasPlanarDrawingOn U ∧
(letI : DecidableRel T.Adj := dT
letI : DecidableRel U.Adj := dU
T.edgeFinset ⊆ U.edgeFinset) ∧
(letI : DecidableRel T.Adj := dT
letI : DecidableRel U.Adj := dU
U.edgeFinset.card = 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).