Edge count of a maximum drawable supergraph
ProvedWilliamsonShmoys.drawable_triangulation_supergraph_maximal_count_v2approximation-algorithmsplanar-graphstreewidth
A drawable graph with at least three vertices that maximizes edge count among its drawable supergraphs on the same vertex type has exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_triangulation_supergraph_maximal_count_v2 {V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V) (hdraw : HasPlanarDrawingOn L) (hV : 3 ≤ Fintype.card V) (hmax : ∀ M : SimpleGraph V, L ≤ M → HasPlanarDrawingOn M → M.edgeSet.ncard ≤ L.edgeSet.ncard) : 3 * Fintype.card V - 6 = L.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).