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.
Users
Please
log in to take part in the discussion (add own reviews or comments).