Lower bounds for the isoperimetric numbers of random regular graphs

Brett Kolesnik, Nick Wormald

The vertex isoperimetric number of a graph $G=(V,E)$ is the minimum of the ratio $|{\partial }_{V}U|/|U|$ where $U$ ranges over all nonempty subsets of $V$ with $|U|/|V|\le u$ and $\p…