Edge bound for maximal planar graphs
ProvedWilliamsonShmoys.maximal_planar_edge_count_bound_938af664_b2aa_4ceb_8ad4_a78c6b3943d3approximation-algorithmsplanar-graphstreewidth
An inclusion-maximal graph admitting the specified crossing-free drawing has at most 3 * |V| - 6 edges when |V| ≥ 3. This is the topological core: maximality forces triangular faces, after which Euler’s formula gives the edge bound. The strict vertex-count hypothesis is retained, including the equality case |V| = 3.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Data.Set.Card set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_bound_938af664_b2aa_4ceb_8ad4_a78c6b3943d3
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hmax : ∀ K : SimpleGraph V,
(∀ ⦃u v : V⦄, G.Adj u v → K.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn K → K = G) :
G.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).