I will talk about the history of the Erdos-Renyi random graph model G(n,p), and its critical point, p=1/n. The critical window is a range of p, in which the largest components have the same scaling but not exactly the same distributional limit as at criticality itself. I will discuss several aspects of the behaviour of these graphs within the critical window, including a surprising connection to the mixing of random permutations.