Finite irreflexive homomorphism-homogeneous binary relational systems
From MaRDI portal
Abstract: A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Nev{s}etv{r}il introduced a relaxed version of homogeneity: we say that a structure is homomorphism-homogeneous if every homomorphism between finite substructures of the structure extends to an endomorphism of the structure. In this paper we characterize all finite homomorphism-homogeneous relational systems with one irreflexive binary relation.
Recommendations
Cited in
(8)- Finite homomorphism-homogeneous permutations via edge colourings of chains
- Homomorphism-homogeneous partially ordered sets
- Towards finite homomorphism-homogeneous relational structures
- Connected-homomorphism-homogeneous graphs
- On finite reflexive homomorphism-homogeneous binary relational systems
- On the complexity of deciding homomorphism-homogeneity for finite algebras
- Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops
- ON EXTENSIONS OF PARTIAL ISOMORPHISMS
This page was built for publication: Finite irreflexive homomorphism-homogeneous binary relational systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144304)