In this paper we investigate the connection between infinite permutation monoids and
bimorphism monoids of first-order structures. Taking our lead from the study of …

We show that the independence number of a countably infinite connected HH-
homogeneous graph that does not contain the Rado graph as a spanning subgraph is finite …

In~\cite {Hartman: 2014}, Hartman, Hubi\v cka and Ma\v sulovi\'c studied the hierarchy of
morphism extension classes for finite $ L $-colored graphs, that is, undirected graphs …

The notion of homomorphism homogeneity was introduced by Cameron and Nešetřil as a
natural generalization of the classical model-theoretic notion of homogeneity. A relational …

Permutation monoids and MB-homogeneous structures Page 1 Permutation monoids and
MB-homogeneous structures Tom Coleman t.coleman@uea.ac.uk (joint work with David Evans …

A structure is called ultrahomogeneous if every isomorphism between finitely generated
substructures of the structure extends to an automorphism of the structure. Recently …

A relational structure is homomorphism-homogeneous if every homomorphism between
finite substructures extends to an endomorphism of the structure. A point-line geometry is a …

Towards the Classification of Polymorphism-homogeneous Metric Spaces Page 1 Towards the
Classification of Polymorphism-homogeneous Metric Spaces Bojana Pantic Department of …

Homomorphism-homogeneity of relational structures requires every local homomorphism
between finite induced substructures extends to surjective homomorphism on the whole …

This work analyses properties of relational structures that imply a high degree of symmetry.
A structure is called homogeneous if every mapping from any finite substructure can be …