Random Lifts of Graphs: Edge Expansion

Authors:
Alon Amit;Nathan Linial
Affiliations:
Institute of Mathematics, Hebrew University, Jerusalem 91904, Israel (e-mail: alona@math.huji.ac.il);Institute of Computer Science, Hebrew University, Jerusalem 91904, Israel (e-mail: nati@cs.huji.ac.il)
Venue:
Combinatorics, Probability and Computing
Year:
2006

Citing 6
Cited 4

Explicit expanders and the Ramanujan conjectures

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Topological graph theory

Topological graph theory
The isoperimetric number of random regular graphs

European Journal of Combinatorics
On the second eigenvalue of random regular graphs

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Tools from higher algebra

Handbook of combinatorics (vol. 2)
Permutation Pseudographs and Contiguity

Combinatorics, Probability and Computing

Hamilton cycles in random lifts of graphs

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
On the number of perfect matchings in random lifts

Combinatorics, Probability and Computing
Tight Products and Graph Expansion

Journal of Graph Theory
Random Lifts of $K_5\backslashe$ are 3-Colorable

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We continue the study of random lifts of graphs initiated in [4]. Here we study the possibility of generating graphs with high edge expansion as random lifts. Along the way, we introduce the method of $\epsilon$-nets into the study of random structures. This enables us to improve (slightly) the known bounds for the edge expansion of regular graphs.