Asymptotics of Largest Components in Combinatorial Structures

摘要

Given integers m and n, we study the probability that structures of size n have all components of size at most m. The results are given in term of a generalized Dickman function of n/m.