It is shown that for every •>0 with the probability tending to 1 as n⇒• a random graph G(n,p) contains induced cycles of all lengths k,3•k•(1-•)nlogc/c, provided c(n)=(n-1)p(n)⇒•.
