Adding random edges to dense graphs
  This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and $k$-connectivity. 
Tom Bohman and Alan Frieze and Michael Krivelevich and Ryan R. Martin
math.CO