Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_drawable_graph_edge_count_of_planar_drawingapproximation-algorithmsplanar-graphstreewidth
An inclusion-maximal drawable simple graph on at least three finite vertices has exactly 3|V| − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_edge_count_of_planar_drawing
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hdraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hmax : forall Q : SimpleGraph V,
(forall {u v}, P.Adj u v -> Q.Adj u v) ->
WilliamsonShmoys.HasPlanarDrawingOn Q -> Q = P)
(hV : 3 <= Fintype.card V) :
P.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).