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.
| Original language | English |
|---|---|
| Pages (from-to) | 317-332 |
| Number of pages | 16 |
| Journal | Combinatorics Probability and Computing |
| Volume | 15 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2006 |