Premium
Finite homomorphism‐homogeneous tournaments with loops
Author(s) -
Ilić Andreja,
Mašulović Dragan,
Rajković Uroš
Publication year - 2008
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20322
Subject(s) - homomorphism , mathematics , homogeneous , isomorphism (crystallography) , combinatorics , automorphism , homogeneity (statistics) , finite graph , discrete mathematics , endomorphism , graph homomorphism , graph , crystal structure , voltage graph , line graph , chemistry , statistics , crystallography
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