32 citations · 91 across the 36 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
Asymptotic normality of some graph sequences
David Galvin
For a simple finite graph G denote by {G \brace 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 edge…
math.CO2013★ 3 cited
Combinatorially interpreting generalized Stirling numbers
John Engbers, David Galvin, Justin Hilyard
Let be a word in alphabet with 's and 's. Interpreting "" as multiplication by , and "" as differentiation with respect to , the identity $w…