Edge lower bound for a maximal drawable graph
ProvedWilliamsonShmoys.maximal_drawable_graph_edge_lower_bound_3n6_for_planar_dense_extension_v4approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal among drawable supergraphs on the same vertex type has at least 3|V| − 6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_edge_lower_bound_3n6_for_planar_dense_extension_v4
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P)
(hMax : forall Q : SimpleGraph V, P <= Q -> WilliamsonShmoys.HasPlanarDrawingOn Q -> Q <= P) :
3 * Fintype.card V - 6 <= P.edgeSet.ncard := 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).