Maximal drawable graphs have the triangulation edge count
ProvedWilliamsonShmoys.maximal_drawable_graph_has_triangulation_edge_count_repair_a3780995_02f0_4c2f_a98c_6e5f167c3de5approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal among drawable graphs on the same vertices has exactly 3n−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_drawable_graph_has_triangulation_edge_count_repair_a3780995_02f0_4c2f_a98c_6e5f167c3de5
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V) (hPdraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hCard : 3 ≤ Fintype.card V)
(hmax : ∀ Q : SimpleGraph V,
P ≤ Q → WilliamsonShmoys.HasPlanarDrawingOn Q → Q = P) :
P.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).