Edge count of a maximum drawable supergraph
ProvedWilliamsonShmoys.maximal_planar_edge_count_repair_543ac5d4approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three finite ordered vertices whose edge count is maximum among drawable supergraphs has exactly 3|V| - 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_repair_543ac5d4
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hT : WilliamsonShmoys.HasPlanarDrawingOn T)
(hmax : ∀ U : SimpleGraph V, T <= U → WilliamsonShmoys.HasPlanarDrawingOn U →
U.edgeSet.ncard ≤ T.edgeSet.ncard) :
3 * Fintype.card V = T.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).