Sciweavers

Share
CPC
2010

On the Number of Perfect Matchings in Random Lifts

9 years 7 months ago
On the Number of Perfect Matchings in Random Lifts
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) and replacing each edge by a randomly chosen perfect matching between the n-sets corresponding to the endpoints of the edge. Let XG be the number of perfect matchings in a random lift of G. We study the distribution of XG in the limit as n tends to infinity, using the small subgraph conditioning method. We present several results including an asymptotic formula for the expectation of XG when G is d-regular, d 3. The interaction of perfect matchings with short cycles in random lifts of regular multigraphs is also analysed. Partial calculations are performed for the second moment of XG, with full details given for two example multigraphs, including the complete graph K4. To assist in our calculations we provide a theorem for estimating a summation over multiple dimensions using Laplace's method. This res...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc
Added 01 Mar 2011
Updated 01 Mar 2011
Type Journal
Year 2010
Where CPC
Authors Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
Comments (0)
books