The hypercube Q(n), the shuffle-exchange graph S(n) and the teleprinte
r diagram T(n) have the same set of 2n nodes, namely the n digit binar
y strings. Our purpose is to specify precisely the pairwise intersecti
ons of their edge sets and of their arc sets.