  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.
