Related papers: Spanning trees in hyperbolic graphs
Recent papers in the graph machine learning literature have introduced a number of approaches for hyperbolic representation learning. The asserted benefits are improved performance on a variety of graph tasks, node classification and link…
We study the structure of infinite geodesics in the Planar Stochastic Hyperbolic Triangulations $\mathbb{T}_{\lambda}$, which are the hyperbolic analogs of the UIPT. We prove that these geodesics form a supercritical Galton--Watson tree…
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that…
A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning…
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…
The aim of this paper is to further develop the theory of packing trees in a graph. We first prove the classic result of Nash-Williams \cite{NW} and Tutte \cite{Tu} on packing spanning trees by adapting Lov\'asz' proof \cite{Lov} of 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…
We give a geometric description of the Poisson boundaries of certain extensions of free and hyperbolic groups. In particular, we get a full description of the Poisson boundaries of free-by-cyclic groups. We rely upon the description of…
For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
In this paper, we investigate the structural properties of trees and bipartite graphs through the lens of topological indices and combinatorial graph theory. We focus on the First and Second Hyper-Zagreb indices, $HM_1(G)$ and $HM_2(G)$,…
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…
For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
Given a compact surface $\Sigma$ with boundary and a relation $\Gamma$ on $\pi_0(\partial\Sigma)$, we define the prescribed arc graph $\mathscr A(\Sigma,\Gamma)$ to be the full subgraph of the arc graph $\mathscr A(\Sigma)$ containing only…
In this paper, we investigate the problem of generating the spanning trees of a graph $G$ up to the automorphisms or "symmetries" of $G$. After introducing and surveying this problem for general input graphs, we present algorithms that…