Long paths and Hamiltonicity in random graphs [chapter]

Michael Krivelevich, Michael Krivelevich, Konstantinos Panagiotou, Mathew Penrose, Colin McDiarmid, Nikolaos Fountoulakis, Dan Hefetz
Random Graphs, Geometry and Asymptotic Structure  
We discuss several classical results about long paths and Hamilton cycles in random graphs and present accessible versions of their proofs, relying on the Depth First Search (DFS) algorithm and the notion of boosters.
doi:10.1017/cbo9781316479988.002 fatcat:e47ecje37rg7lhpa43gbtgheae