Asymptotics of combinatorial structures with large smallest component

We study the probability of connectedness for structures of size n when all components must have size at least m. In the border between almost certain connectedness and almost certain disconnectedness, we encounter a generalized Buchstab function of n/m.