Interlocked Permutations

We consider graphs whose vertex set is the set of permutations of the first n natural numbers. Two such sequences are adjacent if for two different natural numbers they and their images in the two permutations occupy four different positions in some specific order, implying that the permutations are different. Several such relations are investigated, and for two of them the precise asymptotic magnitude of the largest clique in the graph is determined.