Stirling Numbers of Forests and Cycles

Electronic Journal Of Combinatorics

David Galvin¹ 

关键词: graphical Stirling number;    chromatic vector;    asymptotic normality;    Bell number;    Stirling number;    independent set;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

For a graph $G$ and a positive integer $k$, the graphical Stirling number $S(G,k)$ is the number of partitions of the vertex set of $G$ into $k$ non-empty independent sets. Equivalently it is the number of proper colorings of $G$ that use exactly $k$ colo

【 授权许可】

Others