Exact edge count for a drawable supergraph completion
ProvedWilliamsonShmoys.planar_triangulation_supergraph_exact_edge_count__p2m_30506b39_3246_4bbb_be30_1654e491b341_a4Every drawable finite simple graph on at least three vertices has a drawable supergraph on the same vertex set whose edge count is exactly three times the vertex count minus six, expressed without truncated subtraction.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_triangulation_supergraph_exact_edge_count__p2m_30506b39_3246_4bbb_be30_1654e491b341_a4
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
M ≤ N ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧
M.edgeSet.ncard ≤ N.edgeSet.ncard ∧
N.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).