Edge bound for a maximal drawable graph
ProvedWilliamsonShmoys.planar_augmentation_maximal_edge_countapproximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three vertices that is maximal under drawable edge-preserving extension has at least 3n − 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_augmentation_maximal_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(X : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hX : WilliamsonShmoys.HasPlanarDrawingOn X)
(hmax : ∀ Y : SimpleGraph V, X.edgeSet ⊆ Y.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn Y → Y.edgeSet ⊆ X.edgeSet) :
3 * Fintype.card V ≤ X.edgeSet.ncard + 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).