Hamiltonian-path distance congruence conjecture for Cartesian products of directed cycles
Statement
Let be the Cartesian product of directed cycles of lengths , where and each . For vertices and of , let denote the length of a shortest directed path from to . Hamiltonian-path distance congruence conjecture. There is a Hamiltonian path from to if and only if
This generalizes the coprime-length case, in which the congruence condition is automatic, and remains open according to the supplied source.
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.