Not Every Uniform Tree Covers Ramanujan Graphs

Lubotzky, Alexander; Smirnova-Nagnibeda, Tatiana

doi:10.1006/jctb.1998.1843

Scientific article

English

Not Every Uniform Tree Covers Ramanujan Graphs

Contributors

Lubotzky, Alexander; Smirnova-Nagnibeda, Tatiana

Published in

Journal of combinatorial theory. Series B, vol. 74, no. 2, p. 202-212

Publication date

1998

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.

Keywords

Ramanujan graph
Covering tree
Spectral radius
Mini- mal graph

UNIGE affiliation entities

Faculté des sciences / Section de mathématiques

Citation (ISO format)

LUBOTZKY, Alexander, SMIRNOVA-NAGNIBEDA, Tatiana. Not Every Uniform Tree Covers Ramanujan Graphs. In: Journal of combinatorial theory. Series B, 1998, vol. 74, n° 2, p. 202–212. doi: 10.1006/jctb.1998.1843

Article (Published version)

Identifiers

PID : unige:12428
DOI : 10.1006/jctb.1998.1843

Additional URL for this publication

http://linkinghub.elsevier.com/retrieve/pii/S0095895698918433

Journal ISSN

0095-8956

891views

0downloads

Creation

11/11/2010 14:21:00

First validation

11/11/2010 14:21:00

Update

14/03/2023 16:08:45

Status update

14/03/2023 16:08:44

Last indexation

29/10/2024 17:23:23

Not Every Uniform Tree Covers Ramanujan Graphs

Contributors

Published in

Publication date

Abstract

Keywords

UNIGE affiliation entities

Citation (ISO format)

Main files (1)

Identifiers

Additional URL for this publication

Journal ISSN

Technical informations

Creation

First validation

Update

Status update

Last indexation