in this talk we investigate the erd\h{o}s-renyi model for random graphs, $g(n,p)$. our focus will be on determining the probability that $g(n,p)$ is connected, which was the first problem that erd\h{o}s and renyi considered in their original paper. as time permits we will also discuss the ``phase transition'' of $g(n,p)$.