arXiv Analytics

Sign in

arXiv:2103.03196 [math.CO]AbstractReferencesReviewsResources

Bounds on the Number of Graphical Partitions

K. Blum

Published 2021-03-04Version 1

We narrow in on the number of graphical partitions for which there is no known generating function by manipulating the well known generating function for Frobenius partitions.

Related articles: Most relevant | Search more
arXiv:math/0404467 [math.CO] (Published 2004-04-26)
Generating Functions of Random Walks on Graphs
arXiv:math/0403546 [math.CO] (Published 2004-03-31)
Neighborhood complexes and generating functions for affine semigroups
arXiv:1312.1141 [math.CO] (Published 2013-12-04, updated 2014-03-27)
On the number of coverings of the sphere ramified over given points