Related papers: Spanning trees in hyperbolic graphs
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
We show that trees of manifolds, the topological spaces introduced by Jakobsche, appear as boundaries at infinity of various spaces and groups. In particular, they appear as Gromov boundaries of some hyperbolic groups, of arbitrary…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
We give a complete criterion for when two hyperbolic automorphisms of a tree generate a free, discrete subgroup. The decision depends only on three geometric invariants: the translation lengths of the generators and the length of overlap of…
In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…
We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…
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…
Consider a stationary Poisson process $\eta$ in a $d$-dimensional hyperbolic space of constant curvature $-\varkappa$ and let the points of $\eta$ together with a fixed origin $o$ be the vertices of a graph. Connect each point $x\in\eta$…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
We prove that, among rectangular grid graphs with a fixed number of vertices, the number of spanning trees increases when the side lengths are made more balanced. In particular, among all rectangular grid graphs with $n^2$ vertices, the…
In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…
We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.
We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…
We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.
In [BBM21], Belk, Bleak and Matucci proved that hyperbolic groups can be seen as subgroups of the rational group. In order to do so, they associated a tree of atoms to each hyperbolic group. Not so many connections between this tree and the…
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
We construct a transient bounded-degree graph no transient subgraph of which embeds in any surface of finite genus. Moreover, we construct a transient, Liouville, bounded-degree, Gromov--hyperbolic graph with trivial hyperbolic boundary…
Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…