Edge count of a maximal drawable graph
ProvedWilliamsonShmoys_maximal_planar_graph_has_euler_edge_count__p2m_b5bac186_dc32_4d53_bbd2_ff87f7d5377f_a1approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that has no strictly larger drawable supergraph on the same vertices has exactly 3|V|−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys_maximal_planar_graph_has_euler_edge_count__p2m_b5bac186_dc32_4d53_bbd2_ff87f7d5377f_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V) (dH : DecidableRel H.Adj)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hcard : 3 ≤ Fintype.card V)
(hmax : ∀ (K : SimpleGraph V) (dK : DecidableRel K.Adj),
WilliamsonShmoys.HasPlanarDrawingOn K →
H.edgeFinset ⊆ K.edgeFinset →
K.edgeFinset ⊆ H.edgeFinset) :
H.edgeFinset.card = 3 * Fintype.card V - 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).