Finite homomorphism‐homogeneous tournaments with loops
Andreja Ilić, Dragan Mašulović, Uroš Rajkovič · Journal of Graph Theory · 2008
Abstract A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, Cameron and Nešetř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 article we characterize homomorphism‐homogeneous finite tournaments where vertices are allowed to have loops. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 45–58, 2008