The Isoperimetric Number of Random Regular Graphs

Abstract

We shall show that for every ε > 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 − ε)u edges to the rest of the graph. © 1988, Academic Press Limited. All rights reserved.

Publication Title

European Journal of Combinatorics

Link to Full Text

Share

COinS