Some methods used to obtain best possible upper bounds for non-trivial intersecting uniform hypergraphs can be extended to prove similar results for 'intersecting' families of permutations and partial permutations.