Combinatorica
Expanders obtained from affine transformations
Combinatorica - Theory of Computing
On the second eigenvalue of a graph
Discrete Mathematics
Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q
Journal of Combinatorial Theory Series B
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Combinatorica
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lifts, Discrepancy and Nearly Optimal Spectral Gap
Combinatorica
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On Construction of Almost-Ramanujan Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On the connectivity of key-distribution strategies in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
A key-distribution mechanism for wireless sensor networks using Zig-Zag product
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inherits its size from the large graph, its degree from the small graph and its spectral gap from both. Using this product they gave the first fully-explicit combinatorial construction of expander graphs. They showed how to construct D-regular graphs having spectral gap 1-O(D-1/3). In the same paper, they posed the open problem of whether a similar graph product could be used to achieve the almost-optimal spectral gap 1-O(D-1/2). In this paper we propose a generalization of the zig-zag product that combines a large graph and several small graphs. The new product gives a better relation between the degree and the spectral gap of the resulting graph. We use the new product to give a fully-explicit combinatorial construction of D-regular graphs having spectral gap 1-D-1/2 + o(1).