Related papers: Classes of free group extensions

For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…

In this note we study a family of graphs of groups over arbitrary base graphs where all vertex groups are isomorphic to a fixed countable sofic group $G$, and all edge groups $H<G$ are such that the embeddings of $H$ into $G$ are identical…

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…

Let $\Gamma =(V,E)$ be a reflexive relation with a transitive automorphisms group. Let $v\in V$ and let $F$ be a finite subset of $V$ with $v\in F.$ We prove that the size of $\Gamma (F)$ (the image of $F$) is at least $$ |F|+ |\Gamma…

We develop a categorical framework for studying graphs of groups and their morphisms, with emphasis on pullbacks. More precisely, building on classical work by Serre and Bass, we give an explicit construction of the so-called…

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

We present a coarse convexity result for the dynamics of free group automorphisms: Given an automorphism $\phi$ of a finitely generated free group $F$, we show that for all $x\in F$ and $0\leq i\leq N$, the length of $\phi^i(x)$ is bounded…

In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…

Given a type A in homotopy type theory (HoTT), we can define the free infinity-group on A as the loop space of the suspension of A+1. Equivalently, this free higher group can be defined as a higher inductive type F(A) with constructors unit…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Given a finite, directed, connected graph $\Gamma$ equipped with a weighting $\mu$ on its edges, we provide a construction of a von Neumann algebra equipped with a faithful, normal, positive linear functional…

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

A class K of finite structures is said to have the extension property for automorphisms (EP) if for every A in K there exists an extension B in K such that every partial isomorphism on the structure A extends to an automorphism of B.…

Consider a group $\Gamma$ acting on a formal (Fedosov) deformation quantization $\mathbb{A}_\hbar(M)$ of a symplectic manifold $(M,\omega)$. This canonically induces an action of $\Gamma$ by symplectomorphisms on $M$. We examine the reverse…

Let $K$ be a field of characteristic zero, let $\sigma$ be an automorphism of $K$ and let $\delta$ be a $\sigma$-derivation of $K$. We show that the division ring $D=K(x;\sigma,\delta)$ either has the property that every finitely generated…

A graph $G$ is $k$-vertex-critical if $G$ has chromatic number $k$ but every proper induced subgraph of $G$ has chromatic number less than $k$. The study of $k$-vertex-critical graphs for graph classes is an important topic in algorithmic…

Fix an abelian group $\Gamma$ and an injective endomorphism $F \colon \Gamma \to \Gamma$. Improving on the results of Bell and Moosa, new characterizations are here obtained for the existence of spanning sets, $F$-automaticity, and…

We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there are graphs of arbitrarily large chromatic number and the same clique number as $F$ in which every $F$-free induced subgraph has chromatic…

We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least~5 in this class is…

We study the evolution of random graphs where edges are added one by one between pairs of weighted vertices so that resulting graphs are scale-free with the degree exponent $\gamma$. We use the branching process approach to obtain scaling…