Abstract
For a simple finite graph G denote by 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 \(E_n\) is the graph on n vertices with no edges then coincides with , the ordinary Stirling number of the second kind, and so we refer to as a graph Stirling number. Harper showed that the sequence of Stirling numbers of the second kind, and thus the graph Stirling sequence of \(E_n\), is asymptotically normal—essentially, as n grows, the histogram of , suitably normalized, approaches the density function of the standard normal distribution. In light of Harper’s result, it is natural to ask for which sequences \((G_n)_{n \ge 0}\) of graphs is there asymptotic normality of . Thanh and Galvin conjectured that if for each n, \(G_n\) is acyclic and has n vertices, then asymptotic normality occurs, and they gave a proof under the added condition that \(G_n\) has no more than \(o(\sqrt{n/\log n})\) components. Here we settle Thanh and Galvin’s conjecture in the affirmative, and significantly extend it, replacing “acyclic” in their conjecture with “co-chromatic with a quasi-threshold graph, and with negligible chromatic number”. Our proof combines old work of Navon and recent work of Engbers, Galvin and Hilyard on the normal order problem in the Weyl algebra, and work of Kahn on the matching polynomial of a graph.
Similar content being viewed by others
References
Tomescu, I.: Méthods combinatoires dans le théorie des automates finis. Ph.D. thesis, Bucarest (1971)
Thanh, D.T., Galvin, D.: Stirling numbers of forests and cycles. Electron. J. Comb. 20, P73 (2013)
Harper, L.: Stirling behavior is asymptotically normal. Ann. Math. Stat. 38, 410–414 (1967)
Lévy, P.: Sur une propriété de la loi de Poisson relative aux petites probabilités. Soc. Math. de France, Comptes rendus des scéances de l’année 1936, 29 (1937)
Yan, J.-H., Chen, J.-J., Chang, G.J.: Quasi-threshold graphs. Discret. Appl. Math. 69, 247–255 (1996)
Scherk, H.: De evolvenda functione \((yd.yd.yd \ldots yd X)/dx^n\) disquisitiones nonnullae analyticae. Ph.D. thesis, University of Berlin (1823)
Blasiak, P., Horzela, A., Penson, K., Solomon, A., Duchamp, G.: Combinatorics and Boson normal ordering: a gentle introduction. Am. J. Phys. 75, 639–646 (2007)
Engbers, J., Galvin, D., Hilyard, J.: Combinatorially interpreting generalized Stirling numbers. Eur. J. Comb. 43, 32–54 (2015)
Navon, A.: Combinatorics and fermion algebra. Nuovo Cimento 16, 324–330 (1973)
Gebhard, D., Sagan, B.: A chromatic symmetric function in noncommuting variables. J. Algebraic Comb. 13, 227–255 (2001)
Heilmann, O., Lieb, E.: Theory of monomer–dimer systems. Commun. Math. Phys. 25, 190–232 (1972)
Kahn, J.: A normal law for matchings. Combinatorica 20, 339–391 (2000)
Acknowledgments
Research supported by the Simons Foundation and by NSA grant H98230-13-1-0248.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Galvin, D. Asymptotic Normality of Some Graph Sequences. Graphs and Combinatorics 32, 639–647 (2016). https://doi.org/10.1007/s00373-015-1596-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1596-4