Abstract
The notion of Ramanujan graph has been extended to not necessarily regular graphs by Y. Greenberg. We construct infinite trees with infinitely many finite quotients, none of which is Ramanujan. We give a sufficient condition for a finite graph to be covered by such a tree. © 1998 Academic Press.
Author supplied keywords
Cite
CITATION STYLE
APA
Lubotzky, A., & Nagnibeda, T. (1998). Not Every Uniform Tree Covers Ramanujan Graphs. Journal of Combinatorial Theory. Series B, 74(2), 202–212. https://doi.org/10.1006/jctb.1998.1843
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free