Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_drawable_edge_count_3d83e52d_d7f3_4064_9901_f4d565126921approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three finite ordered vertices that has no strictly larger drawable supergraph has exactly 3|V| − 6 edges. Prove this by showing maximality makes every face triangular, then applying Euler’s formula and counting each edge along its two incident faces.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_edge_count_3d83e52d_d7f3_4064_9901_f4d565126921
{V : Type} [Fintype V] [LinearOrder V]
(X : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hX : WilliamsonShmoys.HasPlanarDrawingOn X)
(hmax : ∀ Y : SimpleGraph V, X ≤ Y →
WilliamsonShmoys.HasPlanarDrawingOn Y → Y = X) :
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).