A jump to the bell number for hereditary graph properties

The current work shows that there is a clean jump for properties with speed in a middle range. In particular, we show that when the speed of a hereditary graph property has speed greater than ncn for all c<1, the speed is at least Bn, the nth Bell number. Equality occurs only for the property containing all disjoint unions of cliques or its complement.