Odd-dimensional hypercube path-pairability conjecture
Statement
For , let denote the -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 ,
is path-pairable. The source notes that even-dimensional hypercubes are not path-pairable, while and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.