Maximal planar graph edge count
ProvedWilliamsonShmoys.maximal_planar_graph_has_exact_edge_count__p2m_27144f45_411a_4982_b72d_bbbc3f64b45b_a1approximation-algorithmsplanar-graphstreewidth
A drawable finite simple graph on at least three vertices that has no strictly larger drawable supergraph has exactly three times its number of vertices minus six edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_has_exact_edge_count__p2m_27144f45_411a_4982_b72d_bbbc3f64b45b_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hDraw : HasPlanarDrawingOn N)
(hV : 3 ≤ Fintype.card V)
(hMax : ∀ P : SimpleGraph V, N ≤ P → HasPlanarDrawingOn P → P = N) :
N.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).