The graph of the n-hypercube's edges is isomorphic to the Hasse diagram of the (n-1)-simplex's face lattice.
This relation may be used to generate the face lattice of an (n-1)-simplex efficiently, since face lattice enumeration algorithms applicable to general polytopes are more computationally expensive.