Connectivity threshold in the Erdős-Rényi model

For every fixed $\epsilon >0$,whereas the probability tends to zero when $p\le (1-\epsilon )\log n/n$. Above the threshold a union bound excludes every component of size at most $n/2$; below it isolated vertices remain with high probability.