Malinovsky, Yaakov2022-05-312022-05-312022-04-13http://hdl.handle.net/11603/24771https://doi.org/10.48550/arXiv.2204.05881We offer an alternative proof, using the Stein-Chen method, of Bollobás' theorem concerning the distribution of the extreme degrees of a random graph. 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.5 pagesen-USThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.Text