Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.triangulation_completion_maximal_edge_count_37d910a7_7508_48a8_9dea_1ce0a7ac4e79approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three finite ordered vertices that is maximal among drawable supergraphs has exactly 3n − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.triangulation_completion_maximal_edge_count_37d910a7_7508_48a8_9dea_1ce0a7ac4e79
{V : Type} [Fintype V] [LinearOrder V]
(Q : SimpleGraph V) (hV : 3 ≤ Fintype.card V)
(hQ : WilliamsonShmoys.HasPlanarDrawingOn Q)
(hmax : ∀ R : SimpleGraph V, Q ≤ R →
WilliamsonShmoys.HasPlanarDrawingOn R → R = Q) :
Q.edgeSet.ncard = 3 * Fintype.card V - 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).