Asymptotic normality of some graph sequences

DOI10.1007/s00373-015-1596-4zbMath1338.05081arXiv1309.0124OpenAlexW1634151452MaRDI QIDQ292264

David Galvin

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.0124

zbMATH Keywords

asymptotic normalitygraph coloringStirling numbersWeyl algebranormal order

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Asymptotic enumeration (05A16)

Related Items (5)

Recent developments in combinatorial aspects of normal ordering ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Asymptotic normality of associated Lah numbers ⋮ File placements, fractional matchings, and normal ordering ⋮ The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs

Cites Work

• Unnamed Item
• Combinatorially interpreting generalized Stirling numbers
• Quasi-threshold graphs
• Stirling numbers of forests and cycles
• Theory of monomer-dimer systems
• Combinatorics and Boson normal ordering: A gentle introduction
• Stirling Behavior is Asymptotically Normal
• A normal law for matchings
• A chromatic symmetric function in noncommuting variables

This page was built for publication: Asymptotic normality of some graph sequences