Affirming a conjecture of Erdos and Renyi we prove that for any (real number) c(1) > 0 for some c(2) > 0, if a graph G has no c(1) (log n) nodes on which the graph is complete or edgeless (i.e., G exemplifies \G\ negated right arrow (c(1) log n)(2)(2)), then G has at least 2(c2n)non-isomorphic (induced) subgraphs. (C) 1998 Academic Press.