The isoperimetric constant of the random graph process, preprint (2008)
Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky
2\Delta graphs, where eG(0) is the edgeless graph on n vertices, and eG(t) is the result of addingan edge to e G(t- 1), uniformly distributed over all the missing edges. We show that in almost every...
The isoperimetric constant of the random graph process (2005)
Benjamini, Itai, Haber, Simi, Krivelevich, Michael, Lubetzky, Eyal
The isoperimetric constant of a graph $G$ on $n$ vertices, $i(G)$, is the minimum of $\frac{|\partial S|}{|S|}$, taken over all nonempty subsets $S\subset V(G)$ of size at most $n/2$, where $\partial...