Random graph coverings. I: General theory and graph connectivity
From MaRDI portal
Publication:700369
DOI10.1007/S004930200000zbMATH Open0996.05105OpenAlexW1974893148MaRDI QIDQ700369FDOQ700369
Publication date: 20 October 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930200000
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Cited In (27)
- On the Number of Perfect Matchings in Random Lifts
- On cylindrical graph construction and its applications
- Spectrum of random d‐regular graphs up to the edge
- Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks
- Random lifts of graphs are highly connected
- Tight products and graph expansion
- Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit
- Eigenvalues of random lifts and polynomials of random permutation matrices
- Expansion of random graphs: new proofs, new results
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Measure preserving words are primitive
- Statistics of finite degree covers of torus knot complements
- The spectral norm of random lifts of matrices
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Universality and sharp matrix concentration inequalities
- Cops and robber on some families of oriented graphs
- Hamilton cycles in random lifts of graphs
- Hamilton cycles in random lifts of graphs
- Ramanujan coverings of graphs
- CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS
- The chromatic number of random lifts of \(K_5\setminus e\)
- Expander graphs and their applications
- Signatures, Lifts, and Eigenvalues of Graphs
- Spectra of lifted Ramanujan graphs
- \(\delta\)-connectivity in random lifts of graphs
- Relative expanders or weakly relatively Ramanujan graphs.
- \(L^p\) norms and support of eigenfunctions on graphs
This page was built for publication: Random graph coverings. I: General theory and graph connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700369)
