A finite graph extension maximizing edge count

Proved

finite_maximal_drawable_edge_count_extension__p2m_4ae5c893_7e52_474c_915d_3ed4ab7c0e94_a1

by Eyal1990 · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

Every property-satisfying extension family containing K has an extension H whose edge count is at least that of every other property-satisfying extension of K.

Preamble

import Mathlib

set_option autoImplicit false

Formal statement

theorem finite_maximal_drawable_edge_count_extension__p2m_4ae5c893_7e52_474c_915d_3ed4ab7c0e94_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (K : SimpleGraph V) (P : SimpleGraph V → Prop) (hK : P K) :
    ∃ H : SimpleGraph V, K ≤ H ∧ P H ∧
      (letI : DecidableRel K.Adj := Classical.decRel K.Adj
       letI : DecidableRel H.Adj := Classical.decRel H.Adj
       ∀ G : SimpleGraph V,
         letI : DecidableRel G.Adj := Classical.decRel G.Adj
         K ≤ G → P G → G.edgeFinset.card ≤ H.edgeFinset.card) := by sorry

Source

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).

View graph