ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PASEPnP_{\text{ASEP}}^{n} be the asymmetric subtour elimination polytope, let x\boldsymbol{x} be a vertex of this polytope, and let N(x)\mathcal{N}(\boldsymbol{x}) denote its neighborhood in the vertex structure considered by the paper. A tour is a Hamiltonian cycle of the complete directed graph on the node set. Neighborhood-tour conjecture. For every vertex x\boldsymbol{x}, the neighborhood N(x)\mathcal{N}(\boldsymbol{x}) contains at least one tour. This is presented as a conjecture based on preliminary computational tests; the supplied text does not establish it or indicate a resolution.

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.