Over fifty years ago, Erdős and Rényi proved the striking result that the structure of the size-random graph G(n, m) undergoes a phase transition as m, the number of edges, grows from less than n/2 to more than n/2. For the past quarter of a century, this phase transition has been studied in great detail, with a host of detailed results emerging, such as the size of the scaling window, and the ...