Bijection between perfect matchings permutations with even cycles

832 Views Asked by At

It is possible to proof that the number of perfect matching on a set of $2n$ elements is $n!!$, and on the other hand, it is also possible to proof that the number of permutations $\varphi$ of a set of $2n$ elements with the property that every cycle of $\varphi$ has even length is $(n!!)^2$. This implies that there exists a bijection between the aforementioned set and the pair of perfect matching. I wonder if someone has a nice interpretation for this bijection; meaning, how can we prove this constructing the bijection directly. Thanks!