On the number of perfect matchings in random lifts

Catherine Greenhill, Svante Janson, Andrzej Rucinski

Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)…