Related papers: Matching arc complexes: connectedness and hyperbol…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We study metrics on two-dimensional simplicial complexes that are conformal either to flat Euclidean metrics or to the ideal hyperbolic metrics described by Charitos and Papadopoulos. Extending the results of our previous paper, we prove…
Rafi and Schleimer recently proved that the natural relation between curve complexes induced by a covering map between two surfaces is a quasi-isometric embedding. We offer another proof of this result using a distance estimate via…
Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
We consider certain correspondences on a Riemann surface, and show that they admit a weak form of hyperbolicity: sufficiently long loops get shorter under lifting at a fixed point and closing. In terms of their algebraic encoding by bisets,…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
In this work, for the given adjacency matrix of a graph, we present an algorithm which checks the connectivity of a graph and computes all of its connected components. Also, it is mathematically proved that the algorithm presents all the…
We prove that the fundamental group of a finite graph of convergence groups with parabolic edge groups is a convergence group. Using this result, under some mild assumptions, we prove a combination theorem for a graph of convergence groups…
A graph $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], Godsil proved that any graph which is a colour class in an…
We algebraically characterize free by cyclic groups that have coarse medians, and prove that this is equivalent to the a priori stronger properties of being colourable hierarchically hyperbolic groups and being quasi-isometric to CAT(0)…
We give technical conditions for a quasi-isometry of pairs to preserve a subgroup being hyperbolically embedded. We consider applications to the quasi-isometry and commensurability invariance of acylindrical hyperbolicity of finitely…
We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex $t$ is created, it makes $k$ independent and uniform choices from $\{1,\dots,t-1\}$ and…
It is well known that for many semilinear parabolic equations there is a global attractor which has a cell complex structure with finite dimensional cells. Additionally, many semilinear parabolic equations have equilibria with finite…
Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…
We explore a novel method to generate and characterize complex networks by means of their embedding on hyperbolic surfaces. Evolution through local elementary moves allows the exploration of the ensemble of networks which share common…
We establish sharp bounds on the mixing rates of a class of two dimensional non-uniformly hyperbolic symplectic maps. This provides a primer on how to investigate such questions in a concrete example and, at the same time, it solves a…
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…