Related papers: Spanning Trees on Lattices and Integration Identit…
We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…
Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint. In this…
The uniform spanning forest measure ($\mathsf{USF}$) on a locally finite, infinite connected graph $G$ with conductance $c$ is defined as a weak limit of uniform spanning tree measure on finite subgraphs. Depending on the underlying graph…
Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
Using a mapping of compact polymers on the Manhattan lattice to spanning trees, we calculate exactly the average number of bends at infinite temperature. We then find, in a high temperature approximation, the energy of the system as a…
For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…
The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit…
In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…
It is relatively easy to construct a finitely generated group with infinite asymptotic dimension: the restricted wreath product of $\mathbb{Z}$ by $\mathbb{Z}$ provides an example. In light of this, it becomes interesting to consider the…
First results towards a general method for asymptotic expansions of Feynman amplitudes in the loop-tree duality (LTD) formalism are presented. The asymptotic expansion takes place at integrand-level in the Euclidean space of the loop…
We express the partition functions of the spanning tree on finite square lattices under five different sets of boundary conditions (free, cylindrical, toroidal, M\"obius strip, and Klein bottle) in terms of a principal partition function…
Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…
The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V…
Using the special value at $u=1$ of Artin-Ihara $L$-functions, we associate to every $\mathbb{Z}$-cover of a finite connected graph a polynomial which we call the \emph{Ihara polynomial}. We show that the number of spanning trees for the…
A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph $G$, let $\sigma_2$ be the minimum degree sum of two nonadjacent vertices in $G$. We consider tree…