Related papers: Random graphs of free groups contain surface subgr…
We show that a quotient group of a CI-group with respect to (di)graphs is a CI-group with respect to (di)graphs.
In a previous paper [1] [MR4101040], we initiated a systematic study of semihypergroups and had a thorough discussion about some important analytic and algebraic objects associated to this class of objects. In this paper, we investigate…
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 show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists…
J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
A classification is given of all the countable homogeneous ordered bipartite graphs.
We discuss the possibility of lifting finite subgroups, and in particular finite cyclic subgroups, with respect to the canonical projections between automorphism and outer automorphism groups of free groups, surface groups and their…
A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the…
A subgroup of a group is contranormal if its normal closure coincides with the group. We call such groups without proper contranormal subgroups contranormal-free. In this paper we prove various results concerning contranormal-free groups…
We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…
Let $\mathcal{F}$ be a family of fixed graphs and let $d$ be large enough. For every $d$-regular graph $G$, we study the existence of a spanning $\mathcal{F}$-free subgraph of $G$ with large minimum degree. This problem is well-understood…
In this expository article, we survey the rapidly emerging area of random geometric simplicial complexes.
The group of automorphisms of the free group on two generators is known to act geometrically, in an essentially unique way, on a 2-dimensional CAT(0) space X. We prove that X contains precisely two Hamiltonian surfaces. By this we mean a…
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of…
There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We determine the largest (i.e. smallest index) characteristic subgroup of surface groups not containing any simple loops.
Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…