For every d >= 2 and odd m >= 3 the directed Cayley graph D_d(m) admits a decomposition of its arcs into d directed Hamilton cycles.
Aquino-Michaels, Completing Claude’s cycles: multi-agent structured exploration on an open combinatorial problem, Version v1.0.0, Zenodo
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2years
2026 2roles
background 1polarities
background 1representative citing papers
Directed 7-tori D_7(m) for odd m >= 3 admit Hamilton decompositions, established by root-flat certificates for m=3,5 and a uniform prefix-count construction for m>=7, with Lean 4 verification of the boundary cases.
citing papers explorer
-
Hamilton decompositions of all directed tori at odd modulus
For every d >= 2 and odd m >= 3 the directed Cayley graph D_d(m) admits a decomposition of its arcs into d directed Hamilton cycles.
-
Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction
Directed 7-tori D_7(m) for odd m >= 3 admit Hamilton decompositions, established by root-flat certificates for m=3,5 and a uniform prefix-count construction for m>=7, with Lean 4 verification of the boundary cases.