Not every uniform tree covers Ramanujan graphs
type: Item
instance of: scholarly article
title: Not every uniform tree covers Ramanujan graphs
zbMATH Open document ID: 1024.05021
author: Alexander Lubotzky
author: Tatiana Nagnibeda
published in: Journal of Combinatorial Theory. Series B
publication date: 2000-06-25T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1464256
zbMATH Keywords: infinite trees
MaRDI profile type: Publication
full work available at URL: jctb.1998.1843
OpenAlex ID: W2044415027
cites work: Uniform Tree Lattices
cites work: On the second eigenvalue and random walks in random \(d\)-regular graphs
cites work: Q3137758
cites work: Finite common coverings of graphs
cites work: Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
cites work: Q4841310
cites work: Eigenvalues of the Laplacian, the first Betti number and the congruence subgroup problem
cites work: Ramanujan graphs
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: Lower bound for the norm of a vertex-transitive graph
DOI: 10.1006/JCTB.1998.1843
description: scientific article; zbMATH DE number 1464256