A note on the distribution of the extreme degrees of a random graph via the Stein-Chen method

We offer an alternative proof, using the Stein-Chen method, of Bollob'{a}s’ theorem concerning the distribution of the extreme degrees of a random graph. Our proof also provides a rate of convergence of the extreme degree to its asymptotic distribution. The same method also applies in a more general setting where the probability of every pair of vertices being connected by edges depends on the number of vertices.