The distribution of the maximum number of common neighbors in the random graph

Let ?(k;n )be the maximum number of common neighbors of a set of k vertices in G(n, p). In this paper, we find an and sigma n such that ?(k;n)-a(n) /sigma n standard Gumbel distribution. (C) 2022 Elsevier Ltd. All rights reserved. converges in distribution to a random variable having the

Automated summary

This paper investigates the maximum number of common neighbors of k vertices in a graph and shows that it follows a standard Gumbel distribution.