Prominent examples include thresholds for connectivity [1]}, for containing a fixed size subgraph [2]}, for containing a perfect matching [3]}, [4]}, [5]}, [6]}, [7]}, [8]}, [9]}, for containing a Hamilton cycle [10]}, [11]}, for Ramsey properties [12]}, [13]}, for containing a clique (or subgraph) factor [5]}, [15]}, [16]}, and for containing a given bounded-degree spanning tree [17]}, [18]}.
