Abstract
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. The picture is rather different. Our main results are partial characterizations of countable graphs and posets with this property; an analogue of Fraïssé's theorem; and representations of monoids as endomorphism monoids of such structures. © 2006 Cambridge University Press.
Cite
CITATION STYLE
APA
Cameron, P. J., & Nešetřil, J. (2006). Homomorphism-homogeneous relational structures. Combinatorics Probability and Computing, 15(1–2), 91–103. https://doi.org/10.1017/S0963548305007091
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free