Is Szymanski's conjecture true?
Basic
6
Ṁ1352060
81%
chance
1D
1W
1M
ALL
From the Wikipedia article:
Szymanski's conjecture states that every permutation on the n-dimensional doubly directed hypercube graph can be routed with edge-disjoint paths. That is, if the permutation σ matches each vertex v to another vertex σ(v), then for each v there exists a path in the hypercube graph from v to σ(v) such that no two paths for two different vertices u and v use the same edge in the same direction.
Example of routing on the cube (n=3):
We know that it's true for n ≤ 4, but is it true for all n?
Will resolve to YES if there's a widely accepted proof that the conjecture is true and NO if there's a widely accepted proof that the conjecture is false.
This question is managed and resolved by Manifold.
Get
1,000
and3.00
Related questions
Related questions
Is Schanuel's conjecture true?
78% chance
Is Hadwiger's conjecture true?
58% chance
Is Rudin's conjecture true?
69% chance
Is Haborth's Conjecture true?
70% chance
Is Goodman's Conjecture true?
71% chance
Is the strong Rudin's conjecture true?
64% chance
Is the Jacobian conjecture true?
76% chance
Is the Unique Games Conjecture true?
65% chance
Is Smale's Mean Value conjecture true?
72% chance
Is the Birch and Swinnerton-Dyer conjecture true?
84% chance