Edge count of an inclusion-maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count_a3317d7a_4b18_491b_9aee_6f2b4185d855approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal under edge inclusion has exactly the triangulation edge count.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_a3317d7a_4b18_491b_9aee_6f2b4185d855
{V : Type} [Fintype V] [LinearOrder V]
(Z : SimpleGraph V)
(hZ : WilliamsonShmoys.HasPlanarDrawingOn Z)
(hmax : ∀ W : SimpleGraph V,
LE.le Z W →
WilliamsonShmoys.HasPlanarDrawingOn W →
W = Z)
(hV : 3 ≤ Fintype.card V) :
Z.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).