Random lifts of graphs: perfect matchings

DOI10.1007/S00493-005-0024-8zbMath1091.05063OpenAlexW1998836349MaRDI QIDQ2568496

Eyal Rozenman, Nathan Linial

Publication date: 27 June 2006

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-005-0024-8

zbMATH Keywords

random graphperfect matching

Mathematics Subject Classification ID

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

Related Items (13)

Cutoff for random lifts of weighted graphs ⋮ Tight products and graph expansion ⋮ Expander graphs and their applications ⋮ Random lifts of graphs are highly connected ⋮ Relative expanders or weakly relatively Ramanujan graphs. ⋮ Expansion of random graphs: new proofs, new results ⋮ Hamilton cycles in random lifts of graphs ⋮ On the Number of Perfect Matchings in Random Lifts ⋮ Hamilton cycles in random lifts of graphs ⋮ Word maps and spectra of random graph lifts ⋮ The spectral norm of random lifts of matrices ⋮ The chromatic number of random lifts of ⋮ Interlacing families. I: Bipartite Ramanujan graphs of all degrees

This page was built for publication: Random lifts of graphs: perfect matchings