On the Number of Perfect Matchings in Random Lifts

DOI10.1017/S0963548309990654zbMath1260.05144arXiv0907.0958MaRDI QIDQ4911113

Catherine Greenhill, Svante Janson, Andrzej Ruciński

Publication date: 13 March 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.0958

zbMATH Keywords

small subgraph conditioning methodfixed connected multigraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Spanning trees in random regular uniform hypergraphs, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Random 4-regular graphs have 3-star decompositions asymptotically almost surely, On the number of spanning trees in random regular graphs, Statistical Matching Theory, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, Covers, orientations and factors, On the chromatic number of a random hypergraph

Cites Work

• Unnamed Item
• Random graph coverings. I: General theory and graph connectivity
• Random lifts of graphs: perfect matchings
• Permutation Pseudographs and Contiguity
• Minimal Determinants and Lattice Inequalities
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Hamilton Cycles in Random Lifts of Directed Graphs
• Trace formulae and spectral statistics for discrete Laplacians on regular graphs (I)
• Almost all cubic graphs are Hamiltonian
• Almost all regular graphs are hamiltonian
• Random lifts of graphs: Independence and chromatic number
• Determinants of Lattices induced by Rational Subspaces
• Random Lifts of Graphs: Edge Expansion
• Hamilton cycles in random lifts of graphs