In a seminal paper, Erdős and Rényi identified a sharp threshold for connectivity of the random graph G(n, p). In particular, they showed that if p log n/n then G(n, p) is almost always connected, and if p log n/n then G(n, p) is almost always disconnected, as n→∞. The clique complex X (H) of a graph H is the simplicial complex with all complete subgraphs of H as its faces. In contrast to the z...