Euler bound for an edge-maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_bound__p2m_6f3d39c4_bdd3_471f_b5e3_5e407be55c6e_a1approximation-algorithmsplanar-graphstreewidth
A connected graph with a crossing-free drawing that is maximal in edge count among drawn supergraphs on the same vertex set satisfies the planar edge bound when it has at least three vertices. The proof route is to derive triangular faces from maximality and then apply Euler’s formula. The hypotheses retain connectedness and the three-vertex lower bound needed by the Euler argument.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_bound__p2m_6f3d39c4_bdd3_471f_b5e3_5e407be55c6e_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hconn : K.Connected)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ (L : SimpleGraph V),
(∀ ⦃u v : V⦄, K.Adj u v → L.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn L →
L.edgeSet.ncard ≤ K.edgeSet.ncard) :
K.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).