Related papers: Spanning trees in hyperbolic graphs
We show that the Gromov boundary of the free product of two infinite hyperbolic groups is uniquely determined up to homeomorphism by the homeomorphism types of the boundaries of its factors. We generalize this result to graphs of hyperbolic…
We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…
Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. Much of the previous…
In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k\geq2$, a $k$-tree is a spanning tree in which every vertex has degree no more than $k$. Let $T$ be a spanning tree of a…
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…
We provide a combinatorial approach to counting the number of spanning trees at the $n$-th layer of a branched $\mathbb{Z}_p$-cover of a finite connected graph $\mathsf{X}$. Our method achieves in explaining how the position of the ramified…
A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in…
We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequent paper to show that every 2-connected graph…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…
We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by $d$. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^{\alpha}$,…
In this paper we define the notion of $(p,\delta)$--Gromov hyperbolic space where we relax Gromov's {\it slimness} condition to allow that not all but a positive fraction of all triangles are $\delta$--slim. Furthermore, we study maximum…
We show that for any surface of genus at least 3 equipped with any choice of framing, the graph of non-separating curves with winding number 0 with respect to the framing is hierarchically hyperbolic but not Gromov hyperbolic. We also…
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs without the diamond K_4-e as a subgraph. We generalize the second…