ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QnQ_n denote the nn-dimensional hypercube. A graph is path-pairable if every pairing of its vertices can be linked by pairwise edge-disjoint paths. Odd-dimensional hypercube conjecture. The (2k+1)(2k+1)-dimensional hypercube Q2k+1Q_{2k+1} is path-pairable for all k∈Nk\in\mathbb{N}. The cases Q1Q_1 and Q3Q_3 are path-pairable, whereas Q2Q_2 is not; it is also known that QnQ_n is not path-pairable for even nn. The conjecture concerns the unresolved higher odd-dimensional cases.

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.