Related papers: Conjugacy for homogeneous ordered graphs
A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…
We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb…
Let $d > 1$, and let $(X,\alpha)$ and $(Y,\beta)$ be two zero-entropy ${\mathbb{Z}}^d$-actions on compact abelian groups by $d$ commuting automorphisms. We show that if all lower rank subactions of $\alpha$ and $\beta$ have completely…
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
Let $X$ be a variety of dimension $n$, and let $\mathrm{Aut}(X)$ be its automorphism group. When $X$ is quasi-affine, we prove that a solvable subgroup of $\mathrm{Aut}(X)$ that is generated by an irreducible family of automorphisms…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…
The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
Let $G$ be a linear algebraic group over an algebraically closed field $k$ and $\mathrm{Aut}_{\mathrm{alg}}(G)$ the group of all algebraic group automorphisms of $G$. For every $\varphi\in \mathrm{Aut}_{\mathrm{alg}}(G)$ let…
Let $X$ be an algebraic variety over $\mathbb{C}$. We say that $X$ is Borel hyperbolic if, for every finite type reduced scheme $S$ over $\mathbb{C}$, every holomorphic map $S^{an}\to X^{an}$ is algebraic. We use a transcendental…
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…
A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…
It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…
We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…