The class
denotes the classic model of n-node random
graphs, where p represents the probability to have an edge between
any two nodes.
The next result includes the case p=1/2, and shows that almost all n-node graphs have constant compactness.