Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.planar_drawing_triangulation_extension_b80c2ba3_repair2_maximal_graph_edge_countapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is inclusion-maximal among drawable supergraphs on the same vertex set has exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_triangulation_extension_b80c2ba3_repair2_maximal_graph_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hmax : ∀ P : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn P →
N.edgeSet ⊆ P.edgeSet →
P.edgeSet ⊆ N.edgeSet) :
N.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).