Related papers: Parafree graphs of groups with cyclic edge groups
In this paper, we study the so-called diagram groups. Our main result is that diagram groups are free if and only if they do not contain any subgroup isomorphic to $\mathbb{Z}^2$. As an immediate corollary, we get that hyperbolic diagram…
We prove that every unconditionally closed subset of a free group is algebraic, thereby answering affirmatively a 76 years old problem of Markov for free groups. In modern terminology, this means that Markov and Zariski topologies coincide…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free…
Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…
The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
To solve problems of Gilbert Baumslag and Hanna Neumann, posed in the 1960's, we construct a nontrivial variety of groups all of whose noncyclic free groups are non-hopfian.
We refine Feighn--Handel's results on subgroups of mapping tori of free groups to the special case of free-by-cyclic groups. We use these refinements to show that any finitely generated free-by-cyclic group embeds in a {finitely generated…
Let $\mc{F}$ be a family of graphs. A graph is {\em $\mc{F}$-free} if it contains no copy of a graph in $\mc{F}$ as a subgraph. A cornerstone of extremal graph theory is the study of the {\em Tur\'an number} $ex(n,\mc{F})$, the maximum…
We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…
This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
It is conjectured that the central quotient of every irreducible Artin group is either virtually cyclic or acylindrically hyperbolic. We prove this conjecture for Artin groups associated to triangle-free graphs and Artin groups of large…
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…
Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…