Related papers: On $k$-geodetic graphs and groups

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…

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Our first result gives a partial converse to a well-known theorem of A. Ancona for hyperbolic groups. We prove that a group $G$, equipped with a symmetric probability measure whose finite support generates $G$, is hyperbolic if it is…

A $k$-free like group is a $k$-generated group $G$ with a sequence of $k$-element generating sets $Z_n$ such that the girth of $G$ relative to $Z_n$ is unbounded and the Cheeger constant of $G$ relative to $Z_n$ is bounded away from 0. By a…

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…

This paper describes a new approach to the problem of the structural research of clusters based on the theory of geodetic and k-geodetic graphs. We firmly believe that this same approach can be used when solving problems of correlation…

The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…

Our main point of focus is the set of closed geodesics on hyperbolic surfaces. For any fixed integer $k$, we are interested in the set of all closed geodesics with at least $k$ (but possibly more) self-intersections. Among these, we…

A simplicial graph is said to be (coarsely) Helly if any collection of pairwise intersecting balls has non-empty (coarse) intersection. (Coarsely) Helly groups are groups acting geometrically on (coarsely) Helly graphs. Our main result is…

Let $k \geq 2$ be an integer. We say that a graph $G$ is $(K_2 \cup kK_1)$-free if it does not contain $K_2 \cup kK_1$ as an induced subgraph. Recently, Shi and Shan conjectured that every $1$-tough and $2k$-connected $(K_2 \cup kK_1)$-free…

A finite, simple and undirected graph $G = (V, E)$ with $p$ vertices and $q$ edges is said to be a $k$-geometric mean graph for a positive integer $k$ if there is an injection $\psi :V(G)\to \{k,k+1,\dots,k+q\}$ such that, when each edge…

Let $G=(V,E)$ be a simple graph. A set $I\subseteq V$ is an independent set, if no two of its members are adjacent in $G$. The $k$-independent graph of $G$, $I_k (G)$, is defined to be the graph whose vertices correspond to the independent…

Let $G$ be a simple graph of order $n$ and let $k$ be an integer such that $1\leq k\leq n-1$. The $k$-token graph $G^{\{k\}}$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $G^{\{k\}}$…

We define an algebraic group over a group $G$ to be a variety - that is, a subset of $G^d$ defined by equations over $G$ - endowed with a group law whose coordinates can be expressed as word maps. In the case where $G$ is a torsion-free…

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

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…

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…