Related papers: On free products of graphs
One version of Whitehead's famous cut vertex lemma says that if an element of a free group is part of a free basis, then a certain graph associated to its conjugacy class that we call the star graph is either disconnected or has a cut…
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…
We show that in the free group of rank 3, given an arbitrary number of automorphisms, the intersection of their fixed subgroups is equal to the fixed subgroup of some other single automorphism.
A new product construction of graphs and digraphs, based on the standard box product of graphs and called the separated box product, is presented, and several of its properties are discussed. Questions about the symmetries of the product…
We give an explicit description of the automorphism group of a product of complete toric varieties over an arbitrary field in terms of the respective automorphism groups of its components. More precisely, we prove that, up to permutation of…
In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored graphs is itself the automorphism groups of an edge-colored…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
Notions of freedom and independence for hypergraphs of models of a theory are defined. Properties of these notions and their applications to some natural classes of theories are studied.
We give upper bounds on the order of the automorphism group of a simple graph
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
A subset $S$ of vertices in a planar graph $G$ is a free set if, for every set $P$ of $|S|$ points in the plane, there exists a straight-line crossing-free drawing of $G$ in which vertices of $S$ are mapped to distinct points in $P$. In…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
We define analogues of the graphs of free splittings, of cyclic splittings, and of maximally-cyclic splittings of $F_N$ for free products of groups, and show their hyperbolicity. Given a countable group $G$ which splits as…
In this paper, we will construct the graph free product of noncommutative probability space. This is the attempt to explain and observe the combinatorial-object-depending probabilistic structure.
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…
We show that the level sets of automorphisms of free groups with respect to the Lipschitz metric are connected as subsets of Culler-Vogtmann space. In fact we prove our result in a more general setting of deformation spaces. As…
The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
The explicit description of the topology of the free product of topological groups being Hausdorff is given. In particular, it is shown that it coincides with the so-called $X_0$-topology for the corresponding colimit $X$ in the category of…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…