Homomorphisms and amalgamation (Q1406546)

A graph \(G\) is called core if each homomorphism \(G \to G\) is an automorphism of \(G\). A graph \(H\) is called \(G\)-colourable if there is a homomorphism \(H \to G\). The author proves that if \(G\) is a finite core, then the class of \(G\)-colourable graphs is a pseudo-amalgamation class in the sense of \textit{R. Fraïssé} [Theory of relations. With an appendix by Norbert Sauer. Revised ed. Studies in Logic and the Foundations of Mathematics 145, North-Holland, Amsterdam (2000; Zbl 0965.03059)]. The result is proven in the more general context of certain relational structures. Thus it is valid also for directed graphs, hypergraphs and several other structures.