Connectivity of a fixed-density binomial random graph ($\mathrm{Pr}(G(n,p)\text{ connected})\to 1,0<p<1\text{ fixed}$)

A disconnected binomial random graph has a connected component of a graph with at most half its vertices. The union bound over its possible vertex sets givesThe final geometric series bound tends to zero for fixed $p>0$.