Related papers: Sofic groups: graph products and graphs of groups
This paper begins the classification of all edge-primitive 3-arc-transitive graphs by classifying all such graphs where the automorphism group is an almost simple group with socle an alternating or sporadic group, and all such graphs where…
A classification is given of all the countable homogeneous ordered bipartite graphs.
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…
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 investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
We introduce a class of objects which we call 'affine surfaces'. These provide families of foliations on surfaces whose dynamics we are interested in. We present and analyze a couple of examples, and we define concepts related to these in…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We consider metric ultraproducts of finite groups with respect to some classes of length functions. All sofic groups embed into these ultraproducts. We study embeddings of normed groups. We also show that in some natural situations such an…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…
We investigate closure results for C-approximable groups, for certain classes C of groups with invariant length functions. In particular we prove, each time for certain (but not necessarily the same) classes C that (i) the direct product of…
Soft set theory and rough set theory are mathematical tools to deal with uncertainties. In [3], authors combined these concepts and introduced soft rough sets. In this paper, we introduce the concepts of soft rough graphs, vertex and edge…
We prove that all finite graphs of groups with cyclic vertex and edge groups act freely and isometrically on a complete, nonpositively curved geodesic metric space.
We confirm the equitable $\Delta$-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
We give strong necessary conditions on the admissibility of a Polish group topology for an arbitrary graph product of groups $G(\Gamma, G_a)$, and use them to give a characterization modulo a finite set of nodes. As a corollary, we give a…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
The notion of sofic equivalence relation was introduced by Gabor Elek and Gabor Lippner. Their technics employ some graph theory. Here we define this notion in a more operator algebraic context, starting from Connes' embedding problem, and…
The C*-algebra of a skew-product topological graph is a crossed product of the C*-algebra of the base topological graph by a coaction.