Euler-count completion of a drawable graph
ProvedWilliamsonShmoys.planar_drawing_euler_completion_953852c9approximation-algorithmsplanar-graphstreewidth
Every finite drawable simple graph on at least three vertices has a drawable supergraph on the same vertices whose edge count satisfies Euler's maximal-planar equality. The child isolates the drawing extension and planar face-counting argument needed by the parent.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_euler_completion_953852c9
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn G)
(hCard : 3 ≤ Fintype.card V) :
∃ K : SimpleGraph V,
G ≤ K ∧ WilliamsonShmoys.HasPlanarDrawingOn K ∧
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).