Related papers: Sofic groups: graph products and graphs of groups

In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…

In this paper we describe all the finite almost simple groups whose Gruenberg--Kegel graphs coincide with Gruenberg--Kegel graphs of finite solvable groups.

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

We prove that all invariant random subgroups of the lamplighter group $L$ are co-sofic. It follows that $L$ is permutation stable, providing an example of an infinitely presented such a group. Our proof applies more generally to all…

We show that for topological groups and loop contractible coefficients the cohomology groups of continuous group cochains and of group cochains that are continuous on some identity neighbourhood are isomorphic. Moreover, we show a similar…

We introduce and study the class of spherically ordered groups. The notions of spherically ordered groups and their spectra of spherical orderability are introduced. Values of these spectra are found for a series of natural groups.

Building on work of Farb and the second author, we prove that the group of automorphisms of the fine curve graph for a surface is isomorphic to the group of homeomorphisms of the surface. This theorem is analogous to the seminal result of…

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine…

We prove that the Connes embedding problem is stable under graph products.

We extend the characterization of stable subgroups of right-angled Artin groups of Koberda, Mangahas and Taylor to the case of graph products of infinite groups. Specifically, we show that the stable subgroups of such graph products are…

This is a rather personal introductory outline of an interesting class of geometric, resp. graph- and group-theoretical structures. After an introductive section about their genesis, the general construction of horocyclic products is…

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

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 classify all groups which can occur as the topological symmetry group of some embedding of the Heawood graph in $S^3$.

If $G$ is a solvable group, we take $\Delta (G)$ to be the character degree graph for $G$ with primes as vertices. We prove that if $\Delta (G)$ is a square, then $G$ must be a direct product.

We investigate the separability of several well known classes of subgroups of the mapping class group of a surface.

Let $G$ be a fundamental group of a graph of group where the graph is a rose or a star graph and the vertex groups are free groups, free abelian groups or right-angled Artin groups. We prove the linearity of $G$ over $\mathbb{Z}$ under…

In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…