Isaak’s Hamiltonian-path problem for P(n,n−2)
Statement
For , let be the directed overlap graph whose vertices are the -permutations of , with an arc from to whenever is an -permutation of . Does contain a directed Hamiltonian path?
Record
- Added
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.