Title of article
Asymptotics of combinatorial structures with large smallest component
Author/Authors
Bender، نويسنده , , Edward A. and Mashatan، نويسنده , , Atefeh and Panario، نويسنده , , Daniel and Richmond، نويسنده , , L.Bruce، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
9
From page
117
To page
125
Abstract
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.
Keywords
Combinatorial enumeration , components , connectedness
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2004
Journal title
Journal of Combinatorial Theory Series A
Record number
1530909
Link To Document