Asymptotic Normality of Some Graph Sequences


For a simple finite graph G denote by { G k } the number of ways of partitioning the vertex set of G into k non-empty independent sets (that is, into classes that span no edges of G). If En is the graph on n vertices with no edges then { En k } coincides with { n k } , the ordinary Stirling number of the second kind, and so we refer to { G k } as a graph… (More)
DOI: 10.1007/s00373-015-1596-4


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics