Relative expanders or weakly relatively Ramanujan graphs

Duke Mathematical Journal

Volumn 118, Issue 1, 2003, Pages 19-35

  Friedman, Joel ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038171313     PISSN: 00127094     EISSN: None     Source Type: Journal    
DOI: 10.1215/S0012-7094-03-11812-8     Document Type: Article

References (19)

1. [A] N. ALON, "Eigenvalues and expanders" in Theory of Computing (Singer Island, Fla., 1984), Combinatorica 6 (1986), 83-96. MR 88e:05077
2. [AL1] A. AMIT and N. LINIAL, Random graph coverings, I: General theory and graph connectivity, Combinatorica 22 (2002), 1-18. MR 2003a:05131
3. [AL2] _, Random graph coverings, II: Edge expansion, to appear in Combin. Probab. Comput.
4. [ALM] A. AMIT, N. LINIAL, and J. MATOUŠEK, Random lifts of graphs: Independence and chromatic number, Random Structures Algorithms 20 (2002), 1-22. MR 2003a:05132
5. [BS] A. BRODER and E. SHAMIR, "On the second eigenvalue of random regular graphs" in 28th Annual Symposium on Foundations of Computer Science (Los Angeles, 1987), IEEE Comput. Soc. Press, Washington, D.C., 1987, 286-294. MR 89c:68007
6. [B] M. W. BUCK, Expanders and diffusers, SIAM J. Algebraic Discrete Methods 7 (1986), 282-304. MR 87e:68088
7. [F1] J. FRIEDMAN, On the second eigenvalue and random walks in random d-regular graphs, Combinatorica 11 (1991), 331-362. MR 93i:05115
8. [F2] _, Some geometric aspects of graphs and their eigenfunctions, Duke Math. J. 69 (1993), 487-525. MR 94b:05134
9. [F3] _, Relative expansion and an extremal degree two cover of the Boolean cube, preprint, 1994.
10. [F4] _, Further remarks on relative expanders, in preparation.
11. [FKS] J. FRIEDMAN, J. KAHN, and E. SZEMERÉDI, "On the second eigenvalue in random regular graphs" in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, 1989), Association for Computing Machinery, New York, 1989, 587-598. MR 90c:68003
12. [G] Y. GREENBERG, On the spectrum of graphs and their universal covering (in Hebrew), Ph.D. thesis, Hebrew University, Jerusalem, 1995.
13. [GJKW] C. GREENHILL, S. JANSON, J. H. KIM, and N. C. WORMALD, Permutation pseudographs and contiguity, Combin. Probab. Comput. 11 (2002), 273-298. CMP 1 909 503
14. [LR] N. LINIAL and E. ROZENMAN, Random graph coverings, IV: Perfect matchings, to appear in Combinatorica.
15. [LN] A. LUBOTZKY and T. NAGNIBEDA, Not every uniform tree covers Ramanujan graphs, J. Combin. Theory Ser. B 74 (1998), 202-212. MR 2000g:05052
16. [LPS] A. LUBOTZKY, R. PHILLIPS, and P. SARNAK, Ramanujan graphs, Combinatorica 8 (1988), 261-277. MR 89m:05099
17. [M] G. A. MARGULIS, Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators (in Russian), Problemy Peredachi Informatsii 24, no. 1 (1988), 51-60. MR 89f:68054
18. [Mo] M. MORGENSTERN, Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q, J. Combin. Theory Ser. B 62 (1994), 44-62. MR 95h:05089
19. [N] A. NILLI, On the second eigenvalue of a graph, Discrete Math. 91 (1991), 207-210. MR 92j:05124