Routing permutations in the hypercube
Résumé
We study an n-dimensional directed symmetric hypercube Hn, in which every pair of adjacent vertices is connected by two arcs of opposite directions. Using the computer, we show that for H4 and for any permutation on its vertices, there exists a system of pairwise arc-disjoint directed paths from each vertex to its target in the permutation.