Triangular dart successor has no fixed points
DisprovedWilliamsonShmoys.localSuccessor_ne_self__p2m_d0b65569_8792_429c_bbc9_f16b6065a44f_a5approximation-algorithmsplanar-graphstreewidth
A fixed point would, after applying the inverse dart equivalence, equate an index in Fin 3 with its cyclic successor, which is impossible. This supplies the parent’s fixed-point-free hypothesis without using the corner assumptions.
Preamble
import Definitions.Def_WilliamsonShmoys_TriangularMap import Mathlib set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.localSuccessor_ne_self__p2m_d0b65569_8792_429c_bbc9_f16b6065a44f_a5
{V : Type} [Fintype V] {F : Type} [Fintype F] {H : SimpleGraph V}
(dart : (F × Fin 3) ≃ H.Dart) (a : H.Dart) :
(fun a : H.Dart =>
dart ((dart.symm a.symm).1, (dart.symm a.symm).2 + 1)) a ≠ a := 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).