Related papers: Regluing graphs of Free Groups

In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…

The purpose of this note is to provide a short alternate proof that (combined with a theorem proven by Szczepanski) shows that a group which is relatively hyperbolic in the sense of the definition of Gromov is relatively hyperbolic in the…

We use hyperbolic towers to answer some model theoretic questions around the generic type in the theory of free groups. We show that all the finitely generated models of this theory realize the generic type $p_0$, but that there is a…

In this paper we consider a large family of graphs of hierarchically hyperbolic groups (HHG) and show that their fundamental groups admit HHG structures. To do that, we will investigate the notion of hierarchical quasi convexity and show…

Suppose $G$ is a 1-ended finitely generated group that is hyperbolic relative to P a finite collection of 1-ended finitely generated subgroups. Our main theorem states that if the boundary $\partial (G, P)$ has no cut point, then $G$ has…

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…

Minor changes in the exposition and small corrections on the previous version.

Let K be a fine hyperbolic graph and G be a group acting on K with finite quotient. We prove that G is exact provided that all vertex stabilizers are exact. In particular, a relatively hyperbolic group is exact if all its peripheral groups…

We prove that the palindromic width of HNN extension of a group by proper associated subgroups is infinite. We also prove that the palindromic width of the amalgamated free product of two groups via a proper subgroup is infinite (except…

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

Let $S$ be either a free group or the fundamental group of a closed hyperbolic surface. We show that if $G$ is a finitely generated residually-$p$ group with the same pro-$p$ completion as $S$, then two-generated subgroups of $G$ are free.…

A graph is $k$-critical if it is $k$-chromatic but each of its proper induced subgraphs is ($k-1$)-colorable. It is known that the number of $4$-critical $P_5$-free graphs is finite, but there is an infinite number of $k$-critical…

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 discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…