Not every uniform tree covers Ramanujan graphs

DOI10.1006/jctb.1998.1843zbMath1024.05021OpenAlexW2044415027MaRDI QIDQ1569026

Alexander Lubotzky, Tatiana Nagnibeda

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1843

zbMATH Keywords

infinite trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Ramanujan coverings of graphs, Expander graphs and their applications, Relative expanders or weakly relatively Ramanujan graphs., Expansion of random graphs: new proofs, new results, Eigenvalues of graphs and a simple proof of a theorem of Greenberg, A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem, Recent results of quantum ergodicity on graphs and further investigation, From Ramanujan graphs to Ramanujan complexes, Interlacing families. I: Bipartite Ramanujan graphs of all degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Ramanujan graphs
• Finite common coverings of graphs
• On the second eigenvalue and random walks in random \(d\)-regular graphs
• Lower bound for the norm of a vertex-transitive graph
• Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Eigenvalues of the Laplacian, the first Betti number and the congruence subgroup problem
• Uniform Tree Lattices