Homomorphism-homogeneous relational structures

Peter J. Cameron; Jaroslav Nešetřil

doi:10.1017/S0963548305007091

Homomorphism-homogeneous relational structures

Peter J. Cameron^*, Jaroslav Nešetřil

^*Corresponding author for this work

Centre for Interdisciplinary Research in Computational Algebra

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	91-103
Number of pages	13
Journal	Combinatorics Probability and Computing
Volume	15
Issue number	1-2
DOIs	https://doi.org/10.1017/S0963548305007091
Publication status	Published - 1 Jan 2006

Access to Document

10.1017/S0963548305007091

Cite this

@article{b07d3cf1ac9a43f6be5639c46e734d75,

title = "Homomorphism-homogeneous relational structures",

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{\"i}ss{\'e}'s theorem; and representations of monoids as endomorphism monoids of such structures.",

author = "Cameron, {Peter J.} and Jaroslav Ne{\v s}et{\v r}il",

year = "2006",

month = jan,

day = "1",

doi = "10.1017/S0963548305007091",

language = "English",

volume = "15",

pages = "91--103",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1-2",

}

TY - JOUR

T1 - Homomorphism-homogeneous relational structures

AU - Cameron, Peter J.

AU - Nešetřil, Jaroslav

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=29744438001&partnerID=8YFLogxK

U2 - 10.1017/S0963548305007091

DO - 10.1017/S0963548305007091

M3 - Article

AN - SCOPUS:29744438001

SN - 0963-5483

VL - 15

SP - 91

EP - 103

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 1-2

ER -

Homomorphism-homogeneous relational structures

Abstract

Access to Document

Other files and links

Fingerprint

Cite this