On the Edge-Expansion of Graphs

Combinatorics Probability and Computing

Volumn 6, Issue 2, 1997, Pages 145-152

  Alon, Noga ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031521039     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354839700299X     Document Type: Article

References (10)

1. 1, isoperimetric inequalities for graphs and superconcentrators. J. Combinatorial Theory, Ser. B 38 73-88.
2. Alon, N. and Spencer, J. H. (1992) The Probabilistic Method Wiley.
3. Bollobás, B. (1988) The isoperimetric number of random regular graphs. Euro. J. Combinatorics 9 241-244.
4. st ACM STOC 587-598.
5. th ACM STOC 240-246. (See also Lubotzky, A., Phillips, R. and Sarnak, P. (1988) Ramanujan graphs. Combinatorica 8 261-277.)
6. th ACM STOC 240-246. (See also Lubotzky, A., Phillips, R. and Sarnak, P. (1988) Ramanujan graphs. Combinatorica 8 261-277.)
7. Margulis, G. A. (1988) Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators. Problemy Peredachi Informatsii 24 51-60 (in Russian). (English translation in Problems of Information Transmission 24 39-46.)
8. Margulis, G. A. (1988) Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators. Problemy Peredachi Informatsii 24 51-60 (in Russian). (English translation in Problems of Information Transmission 24 39-46.)
9. Nilli, A. (1991) On the second eigenvalue of a graph. Discrete Mathematics 91 207-210.
10. Shearer, J. B. (1992) A note on bipartite subgraphs of triangle-free graphs. Random Structures and Algorithms 3 223-226.