A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product

DOI10.1137/080732651zbMath1222.05147OpenAlexW2015393836WikidataQ62398455 ScholiaQ62398455MaRDI QIDQ3020006

Amnon Ta-Shma, Avraham Ben-Aroya

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)

Related Items (4)

Paradigms for Unconditional Pseudorandom Generators ⋮ Explicit expanders of every degree and size ⋮ Deterministic Tensor Completion with Hypergraph Expanders ⋮ Explicit Near-Ramanujan Graphs of Every Degree

This page was built for publication: A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product