Asymptotic enumeration, global structure, and constrained evolution (Q5931454)

Counting the objects in a finite set is usually easy if all objects can be generated by a sequence of independent decisions. When there exists no such independence then counting becomes much harder. This interesting paper surveys methods applicable for such situations. For example one possible strategy is to show that a certain subclass of those objects can be generated by a sequence of independent decisions, and this subclass contains almost all objects. This also makes it possible to determine the structure of the typical objects: the so-called global structure.