Related papers: Arborescences of Covering Graphs
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
A linkage diagram is obtained from the Carter diagram $\Gamma$ by adding an extra root $\gamma$, so that the resulting subset of roots is linearly independent. With every linkage diagram we associate the linkage label vector…
The arboricity $\Gamma(G)$ of an undirected graph $G = (V,E)$ is the minimal number such that $E$ can be partitioned into $\Gamma(G)$ forests. Nash-Williams' formula states that $k = \lceil \gamma(G) \rceil$, where $\gamma(G)$ is the…
Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…
Let $H$ be a directed acyclic graph other than a rooted star. It is known that there are constants $c(H)$ and $C(H)$ such that the following holds for the complete directed graph $D_n$. There are at most $C\log n$ directed acyclic subgraphs…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…
A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this paper we establish a unified technique to enumerate odd…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…
In this paper, we revisit the problem of sampling edges in an unknown graph $G = (V, E)$ from a distribution that is (pointwise) almost uniform over $E$. We consider the case where there is some a priori upper bound on the arboriciy of $G$.…
The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum…
A graph $G(V,E)$ is $\Gamma$-harmonious when there is an injection $f$ from $V$ to an Abelian group $\Gamma$ such that the induced edge labels defined as $w(xy)=f(x)+f(y)$ form a bijection from $E$ to $\Gamma$. We study $\Gamma$-harmonious…
Arborified multiple zeta values are a generalization of multiple zeta values associated with rooted trees. There are two types of decorated rooted trees, corresponding respectively to the series and the integral expressions. Manchon…
We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.
In this paper, we consider covering graphs obtained by lifting a tree with a loop at each vertex as a voltage graph over a cyclic group. We generalize a tool of Hell, Nishiyama, and Stacho, known as the billiard strategy, for constructing…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of digraphs and measuring their characteristics. The problems of revealing the basis bicomponents, measuring vertex proximity, and ranking from…
The linear arboricity of a graph $G$, denoted by $\text{la}(G)$, is the minimum number of edge-disjoint linear forests (i.e. forests in which every connected component is a path) in $G$ whose union covers all the edges of $G$. A famous…