This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a normal distribution.Here we shall be concerned with the discrete probability space %(n, p ) consisting of the undirected simple graphs with a fixed set of n labeled vertices in which each of ("3 possible edges occurs with the same probability p (0 < p < 1) independently of all other edges. Let x k = &(G) be the number of vertices of degree k of a graph G E %(n, p). Then the expectation of Xk(G) is Adn) = nb(k; n -I , p ) where b(k; n, p ) = (;)pk(lp)"-'.In his paper BollobAs [I] proved, among other results, that if ~n-"' S p = p(n) = o(l), k = k(n) is a natural number and 0 < ! i g Ak(n) d lim Ak(n) < 03, then X, asymptotically has the Poisson distribution with mean Ak(n). In addition, if lim A,(n) = m then for every fixed t almost every graph has at least t vertices of degree k.In this note we focus our attention on the latter case and determine those values of the edge probability p for which the random variable Xk =
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.