Asymptotic enumeration, global structure, and constrained evolution Original Research Article

Determining the cardinality of a class of discrete objects and the structure of a typical element within this class is relatively easy whenever the objects can be generated by a sequence of independent events. If this is not the case, the problem usually becomes much harder. In this paper, we survey results and methods for such classes of objects. Our focus lies on triangle-free graphs and partially ordered sets.