We study the following min-min random graph process G = (G0, G1, . . .): the initial state G0 is an empty graph on n vertices (n even). Further, GM+1 is obtained from GM by choosing a pair {v, w} of distinct vertices of minimum degree uniformly at random among all such pairs in GM and adding the edge {v, w}. The process may produce multiple edges. We show that GM is asymptotically almost surely...