Random graphs were introduced by the Hungarian mathematicians Erdős and Rényi (, ), who imposed a probabilistic framework on classical combinatorial graph theory. At the same time, Edgar N. Gilbert () also studied the theoretical properties of random graphs.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.