A combinatorial construction of almost-Ramanujan graphs using the zig-zag product

DOI10.1137/080732651zbMATH Open1222.05147OpenAlexW2015393836WikidataQ62398455 ScholiaQ62398455MaRDI QIDQ3020006FDOQ3020006

Authors: Avraham Ben-Aroya, Amnon Ta-Shma 

Publication date: 29 July 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080732651

Recommendations

• A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
• ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS
• On Construction of Almost-Ramanujan Graphs
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Explicit expanders of every degree and size

zbMATH Keywords

expander graphscombinatorial constructionzig-zag product

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cited In (12)

• Explicit expanders of every degree and size
• On Construction of Almost-Ramanujan Graphs
• Paradigms for Unconditional Pseudorandom Generators
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Almost-Ramanujan graphs and prime gaps
• Random walks on rotating expanders
• A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
• A generalization of the zig-zag graph product by means of the sandwich product
• ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS
• Explicit Near-Ramanujan Graphs of Every Degree
• Connectedness and isomorphism properties of the zig-zag product of graphs
• Deterministic tensor completion with hypergraph expanders

This page was built for publication: A combinatorial construction of almost-Ramanujan graphs using the zig-zag product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020006)