A random graph with a subcritical number of edges

A random graph Gn(prob(edge) = p) (p = c/n, 0 ci/2j) as n -oo, the random graph does not have a cycle of length > 1. Another result is that, with probability approaching 1, the size of the vth largest component either equals an integer closest to alog(bn/v log5/2 n), a = a(c), b = b(c), or is one less than this integer, provided that v -oo and v = o(n/ log5/2 n).