{"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","summary":"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,…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-08","reactions":{},"formalized":true,"formalizes":[{"title":"Récréations mathématiques, tome II","identifier":"","relationship":"formalizes"}]}