By a $G(n,p)$ graph we mean a graph on $n$ vertices, all possible edges are independently included randomly with probability $p$.
What can be said about the number of connected components? For example, bounds or asymptotic behavior of the expected number of components as $n\rightarrow \infty$ or for $p$ close to 1.