ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k∈Nk\in\mathbb{N}, let Q2k+1Q_{2k+1} denote the (2k+1)(2k+1)-dimensional hypercube. A graph is path-pairable if every pairing of its vertices can be joined by pairwise edge-disjoint paths. Odd-dimensional hypercube conjecture. For every k∈Nk\in\mathbb{N},

Q2k+1Q_{2k+1}

is path-pairable. The source notes that even-dimensional hypercubes are not path-pairable, while Q1Q_1 and Q3Q_3 are path-pairable and the cases of odd dimension at least five were open.

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.