Edge count of a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count__p2m_db367b77_db98_427b_b1c6_513aa1e72eeb_a1approximation-algorithmsplanar-graphstreewidth
An edge-maximal drawable simple graph on at least three vertices has exactly 3|V| − 6 edges. A proof route is to use maximality to show the planar embedding is connected and every face is triangular, then combine the face-edge incidence count with Euler's formula. The lower bound on the vertex count is needed for the triangular maximal-planar conclusion.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_db367b77_db98_427b_b1c6_513aa1e72eeb_a1
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V) (hDraw : HasPlanarDrawingOn P)
(hV : 3 ≤ Fintype.card V)
(hMax : ∀ Q : SimpleGraph V, P ≤ Q → 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).