Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications

• 1 January 1999
• journal article
• Published by Springer Nature in Combinatorica
• Vol. 19  (1) , 125-138
• https://doi.org/10.1007/s004930050049

Abstract

Keywords

• ALGORITHM
• DEPTH
• GRAPHS
• SIZE
• OPTIMAL
• EXPLICIT
• BITS
• CONSTRUCTIONS
• ROUND