Finite irreflexive homomorphism-homogeneous binary relational systems
Combinatorics
2010-01-06 v1
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. Ne\v{s}et\v{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.
Cite
@article{arxiv.1001.0600,
title = {Finite irreflexive homomorphism-homogeneous binary relational systems},
author = {Dragan Mašulović and Rajko Nenadov and Nemanja Škorić},
journal= {arXiv preprint arXiv:1001.0600},
year = {2010}
}
Comments
Submitted to NSJOM (Novi Sad Journal of Mathematics)