Cardinality after removing one element
Provedfinite_cardinality_eq_subtype_ne__p2m_632e18d6_a4cc_4ac2_ab65_0a7319845dde_a3approximation-algorithmsplanar-graphstreewidth
For a finite type, removing one chosen element leaves a subtype whose cardinality is one less.
Preamble
import Mathlib.Data.Set.Card
Formal statement
theorem finite_cardinality_eq_subtype_ne__p2m_632e18d6_a4cc_4ac2_ab65_0a7319845dde_a3
{α : Type} [Finite α] (a : α) :
Nat.card α = Nat.card {x : α // x ≠ a} + 1 := 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).