Related papers: Hyperforests on the Complete Hypergraph by Grassma…
Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and…
We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial objects are represented by non-Gaussian Grassmann integrals. As a special case, we show that unrooted spanning forests, which arise as a q…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…
Generating graphs from a target distribution is a significant challenge across many domains, including drug discovery and social network analysis. In this work, we introduce a novel graph generation method leveraging $K^2$-tree…
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…
Let us consider a truncated matroid $M_{\Gamma}^{r}$ of rank $r$ of a graphic matroid of a graph $\Gamma$. The basis for $M_{\Gamma}^{r}$ is the set of the forests with $r$ edges in $\Gamma$. We consider this basis generating function and…
Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…
We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
The seminal papers of Edmonds \cite{Egy}, Nash-Williams \cite{NW} and Tutte \cite{Tu} have laid the foundations of the theories of packing arborescences and packing trees. The directed version has been extensively investigated, resulting in…
Using local detailed balance we rewrite the Kirchhoff formula for stationary distribution of Markov jump processes in terms of a physically interpretable tree-ensemble. We use that arborification of path-space integration to derive a…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
It is a remarkable fact that for many statistics on finite sets of combinatorial objects, the roots of the corresponding generating function are each either a complex root of unity or zero. These and related polynomials have been studied…