Asymptotics of combinatorial structures with large smallest component

Edward A. Bender,Atefeh Mashatan,Daniel Panario,L. Bruce Richmond

Journal of Combinatorial Theory, Series A（2004）

引用 8|浏览0

暂无评分

摘要

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.

查看译文

关键词

combinatorial enumeration,generalized buchstab function,connectedness,certain connectedness,large smallest component,components,size n,combinatorial structure,certain disconnectedness,generating function,connected component,finite field

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要