ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be the Cartesian product of kk directed cycles of lengths m1,m2,…,mkm_1,m_2,\ldots,m_k, where k≥3k\geq 3 and each mi≥2m_i\geq 2. For vertices uu and vv of XX, let dX(u,v)d_X(u,v) denote the length of a shortest directed path from uu to vv. Hamiltonian-path distance congruence conjecture. There is a Hamiltonian path from uu to vv if and only if

dX(u,v)≡−1(modgcd⁡(m1,m2,…,mk)).d_X(u,v)\equiv -1\pmod{\gcd(m_1,m_2,\ldots,m_k)}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.