Hung's Hamiltonian decomposition conjecture for augmented cubes
Statement
An -dimensional augmented cube is a graph in which each vertex is represented by an -bit binary string, with adjacency defined according to the augmented-cube construction. A Hamiltonian decomposition is a collection of pairwise edge-disjoint Hamiltonian cycles whose edges partition the edge set.
Hung's conjecture. An -dimensional augmented cube admits a Hamiltonian decomposition.
Hypercubes admit Hamiltonian decompositions, and the conjecture asks whether the analogous property holds for every augmented cube. As far as the source indicates, this conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.