Deranged Perfect Matchings on complete graph and balanced complete r-partite graph

Boqing Deng

We proved that for any finite collection of sparse subgraphs $(D_m{)}_{m=1}^{\ell }$ of the complete graph $K_{2n}$, and a uniformly chosen perfect matching $R$ in $K_{2n}$, the random…