Edge-maximal drawable completion
ProvedWilliamsonShmoys.planar_drawing_edge_maximal_completion__p2m_0fb3eb1a_7dcf_4fa9_a911_841bd56bc763_a1For a finite vertex type, every drawable graph has a drawable supergraph whose edge count is at least that of every other drawable supergraph of the original graph. This follows by maximizing edge count over the finite family of simple graphs on the vertex type; the original graph witnesses that the family is nonempty.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_maximal_completion__p2m_0fb3eb1a_7dcf_4fa9_a911_841bd56bc763_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
M ≤ N ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧
M.edgeSet.ncard ≤ N.edgeSet.ncard ∧
∀ K : SimpleGraph V,
M ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K →
N.edgeSet.ncard ≤ K.edgeSet.ncard := 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).