Drawable completion with triangular edge count
ProvedWilliamsonShmoys.planar_drawingOn_triangulation_edge_countapproximation-algorithmsplanar-graphstreewidth
Any drawable simple graph on a finite linearly ordered vertex type with at least three vertices has a drawable supergraph on the same vertices with exactly three times the number of vertices minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawingOn_triangulation_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P) :
∃ Q : SimpleGraph V, P ≤ Q ∧
WilliamsonShmoys.HasPlanarDrawingOn Q ∧
Q.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).