Id: palomar/PALOMAR-2026-11-08-000007 Url: https://github.com/jtraverso/walecki-decompositions/tree/5e8a6eab7b0c8dacc4eb41b5c480bb90ed449a0e Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-08-000007-v1.json Repo: https://github.com/jtraverso/walecki-decompositions Tags: math.CO, msc:05C70, msc:05C45 Score: 0 Title: Walecki's decompositions of complete graphs into Hamiltonian cycles and paths Trust: high Domain: math.CO Source: palomar Authors: Juan Pablo Traverso Gianini Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-08 Formalized: true Formalizes: title=Récréations mathématiques, tome II identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-08-000007 A Lean 4 / Mathlib proof of Walecki's theorem: for every m, the complete graph on 2m + 1 vertices is the edge-disjoint union of m Hamiltonian cycles (hamiltonian_cycles_odd), and the complete graph on 2m vertices is the edge-disjoint union of m Hamiltonian paths (hamiltonian_paths_even). Both are stated for an arbitrary finite vertex type of the given cardinality, with Mathlib's Walk.IsHamiltonianCycle and Walk.IsHamiltonian, pairwise disjoint edge lists, and every edge of the complete graph on some cycle (path). The proof is Walecki's zig-zag construction: on ZMod (2m) the paths i, i+1,…