Related papers: The structure of random automorphisms of the rando…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

We show that for every graph $H$, there is a hereditary weakly sparse graph class $\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\mathcal C_H$ have bounded treewidth.…

We classify the normal CR structures on $S^3$ and their automorphism groups. Together with [3], this closes the classification of normal CR structures on contact 3-manifolds. We give a criterion to compare 2 normal CR structures, and we…

We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the graph $\Gamma_G(N)$, which is the graph associated to the conjugacy classes of $G$ contained in $N$, has no triangles and when the graph…

We show that the automorphism group of every zero entropy infinite shift admits a "drift" homomorphism to $(\mathbb{R},+)$ that maps the shift map to 1. This homomorphism arises as the expectation, under an invariant measure, of a cocycle…

A group $G$ is said to have property $R_{\infty}$ if for every automorphism $\varphi \in {\rm Aut}(G)$, the cardinality of the set of $\varphi$-twisted conjugacy classes is infinite. Many classes of groups are known to have such property.…

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…

The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.

An automorphism of a graph product of groups is conjugating if it sends each factor to a conjugate of a factor (possibly different). In this article, we determine precisely when the group of conjugating automorphisms of a graph product…

We study automorphism groups of randomizations of separable structures, with focus on the $\aleph_0$-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original…

We classify isotopy classes of automorphisms (self-homeomorphisms) of 3-manifolds satisfying the Thurston Geometrization Conjecture. The classification is similar to the classification of automorphisms of surfaces developed by Nielsen and…

We show that the probability that a random graph $G\sim G(n,p)$ contains no Hamilton cycle is $(1+o(1))Pr(\delta (G) < 2)$ for all values of $p = p(n)$. We also prove an analogous result for perfect matchings.

Let S be any orientable surface of infinite genus with a finite number of boundary components. In this work we consider the curve complex C(S), the nonseparating curve complex N(S) and the Schmutz graph G(S) of S. When all the topological…