On the maximum number of common neighbours in dense random regular graphs

Abstract

We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph. The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic equivalence with the maximum component of a vector with independent marginal distributions. The other step is to prove that the distribution of the number of common neighbours for each pair of vertices can be approximated by the binomial distribution.