Triangulated planar supergraph on the same vertices
ProvedWilliamsonShmoys.exists_triangulated_planar_supergraphapproximation-algorithmsplanar-graphstreewidth
Every connected graph with a crossing-free drawing and at least three vertices has a planar supergraph on the same vertex type whose edge count is exactly 3n−6. The conclusion also records edge-count monotonicity for the original graph.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_triangulated_planar_supergraph
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V)
(hconn : ∀ u v : V, Nonempty (G.Walk u v)) :
∃ H : SimpleGraph V, G ≤ H ∧
WilliamsonShmoys.HasPlanarDrawingOn H ∧
G.edgeSet.ncard ≤ H.edgeSet.ncard ∧
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).