Path-pairability conjecture for odd-dimensional hypercubes
Statement
Let denote the -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 -dimensional hypercube is path-pairable for all . The cases and are path-pairable, whereas is not; it is also known that is not path-pairable for even . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.