Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\dots ,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n\ge 2$.