The Isoperimetric Number of Random Regular Graphs

We shall show that for every e > 0 there is a natural number r such that in almost every r-regular graph of order n, every set of u ≤ n/2 vertices is joined by at least (r/2 - e)u edges to the rest of the graph.