Random graph's Hamiltonicity is strongly tied to its minimum degree

We show that the probability that a random graph $G\sim G(n,p)$ contains no Hamilton cycle is $(1+o(1))Pr(\delta (G)<2)$ for all values of $p=p(n)$. We also prove an analogous result for perfect matchings.