Abstract. We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known results about the exponential generating functions for the different number of vertices. We also consider some applications, such as counting hyperforests in the k-uniform complete hypergraph and the one complete in hyperedges of all dimensions. Some general features of the asymptotic regimes for a large number of connected components are discussed.

PACS numbers: 05.50.+q, 02.10.Ox, 11.10.Hi, 11.10.Kk

Print publication: Issue 20 (23 May 2008)
Received 11 February 2008
Published 24 April 2008