Published online by Cambridge University Press: 15 March 2026
In this final chapter we study in more detail the properties of the Erdős–Rényi random graph G(n, p). The first half of the chapter introduces the concept of a threshold, covers fundamental results such as the threshold for containing a fixed subgraph and for being connected, and gives Erdős’ classic probabilistic construction of graphs with high girth and chromatic number. The second half of the chapter, which is aimed at Masters students, covers some more advanced material, including the problem of finding spanning subgraphs in G(n, p), the threshold for Hamiltonicity, and the emergence of the giant component. In particular, the final two sections provide striking examples of the power of pseudorandomness.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.