Threshold probabilities for the existence in a random graph on n verti
ces of a graph isomorphic to a given graph of order Cn and average deg
ree at least three are investigated. In particular it is proved that t
he random graph G(n, p) on n vertices with edge probability p = ((1 epsilon) log n/n)1/2, epsilon < 1, contains a square grid on epsilonn/
2 vertices. (C) 1994 John Wiley & Sons, Inc.