Hamiltonian decomposition of Z_m^3 Cayley digraphs for all m > 2 — a complete solution to Knuth's "Claude's Cycles," found by LLM agents under a structured exploration prompt. Constructions, proofs, Lean formalization, and a verification suite.
mathematics graph-theory combinatorics knuth automated-reasoning lean4 llm-agents cayley-graph ai-for-math hamiltonian-decomposition
-
Updated
Jul 3, 2026 - TeX