Edge count of a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_graph_edge_count_retry2approximation-algorithmsplanar-graphstreewidth
A graph on at least three vertices that admits a planar drawing and has no proper planar supergraph on the same vertex type has exactly 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_count_retry2
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hMax : forall N : SimpleGraph V, M <= N ->
WilliamsonShmoys.HasPlanarDrawingOn N -> N = M) :
(M.edgeSet.ncard : Int) = 3 * (Fintype.card V : Int) - 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).