A drawable supergraph with maximum edge count
ProvedWilliamsonShmoys.exists_drawable_supergraph_max_edge_countapproximation-algorithmsplanar-graphstreewidth
Among drawable supergraphs of H on the finite vertex type, there is one whose finite edge set has maximum cardinality.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.exists_drawable_supergraph_max_edge_count {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hdraw : WilliamsonShmoys.HasPlanarDrawingOn H) : ∃ K : SimpleGraph V, H ≤ K ∧ WilliamsonShmoys.HasPlanarDrawingOn K ∧ ∀ L : SimpleGraph V, H ≤ L → WilliamsonShmoys.HasPlanarDrawingOn L → Nat.card {e : Sym2 V // e ∈ L.edgeSet} ≤ Nat.card {e : Sym2 V // e ∈ K.edgeSet} := 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).