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

DOI10.1137/080732651MaRDI QIDQ3020006zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

expander graphscombinatorial constructionzig-zag product

Mathematics Subject Classification ID

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

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

Cited in

(12)

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

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)