Edge bound for a connected finite simple planar drawing
ProvedWilliamsonShmoys.connected_planar_drawing_edge_count__p2m_2c262075_af7a_40b5_8216_f56b847d81a6_a3A connected finite simple graph on at least three vertices with the supplied crossing-free drawing has at most 3n−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_drawing_edge_count__p2m_2c262075_af7a_40b5_8216_f56b847d81a6_a3 {V : Type} [Fintype V] [LinearOrder V] (T : SimpleGraph V) (hV : 3 ≤ Fintype.card V) (hConn : T.Connected) (hT : WilliamsonShmoys.HasPlanarDrawingOn T) : T.edgeSet.ncard ≤ 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).