Abstract
A structure is called ultrahomogeneous if every isomorphism between finitely generated 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 finitely generated substructures of the structure extends to an endomorphism of the structure. In this paper we classify finite homomorphism-homogeneous oriented graphs with loops allowed which are uniform (that is, either all vertices have a loop or no vertex has a loop) or disconnected.
Similar content being viewed by others
References
Cameron, P.J., Lockett, D.C.: Posets, homomorphisms and homogeneity. Discrete Math. 310, 604–613 (2010)
Cameron, P.J., Nešetřil, J.: Homomorphism-homogeneous relational structures. Comb. Probab. Comput. 15, 91–103 (2006)
Cherlin, G.L.: The classification of countable homogeneous directed graphs and countable homogeneous \(n\)-tournaments. Memoirs of the American Mathematical Society, vol. 131, no. 621 (1998)
Dolinka, I., Mašulović, D.: Remarks on homomorphism-homogeneous lattices and semilattices. Monatshefte fuer Mathematik 164, 23–37 (2011)
Dolinka, I., Mašulović, D.: A universality result for endomorphism monoids of some ultrahomogeneous structures. In: Proceedings of the Edinburgh Mathematical Society vol. 55, pp. 635–656 (2012)
Hartman, D., Hubička, J., Mašulović, D.: Homomorphism-homogeneous L-colored graphs. Eur. J. Comb. 35, 313–323 (2014)
Ilić, A., Mašulović, D., Rajković, U.: Finite homomorphism-homogeneous tournaments with loops. J. Graph Theory 59(1), 45–58 (2008)
Jungabel, E., Mašulović, D.: Homomorphism-homogeneous monounary algebras. Math. Slovaca 63(5), 993–1000 (2013)
Mašulović, D.: Homomorphism-homogeneous partially ordered sets. Order 24(4), 215–226 (2007)
Mašulović, D.: Some classes of finite homomorphism-homogeneous point line geometries. Combinatorica 33(5), 573–590 (2013)
Mašulović, D.: On the complexity of deciding homomorphism-homogeneity for finite algebras. Int. J. Algebr. Comput. 23(3), 663–672 (2013)
Mašulović, D., Nenadov, R., Škorić, N.: Finite irreflexive homomorphism-homogeneous binary relational systems. Novi Sad J. Math. 40(3), 83–87 (2010)
Mašulović, D., Nenadov, R., Škorić, N.: On finite reflexive homomorphism-homogeneous binary relational systems. Discrete Math. 311, 2543–2555 (2011)
Mašulović, D., Pech, M.: Oligomorphic transformation monoids and homomorphism-homogeneous structures. Fundam. Math. 212, 17–34 (2011)
Rusinov, M., Schweitzer, P.: Homomorphism-homogeneous graphs. J. Graph Theory 65(3), 253–262 (2010)
Acknowledgments
The author would like to thank the three anonymous reviewers for many useful suggestions that significantly improved the clarity of the presentation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the Grant No. 174019 of the Ministry of Education and Science of the Republic of Serbia.
Rights and permissions
About this article
Cite this article
Mašulović, D. Towards the Characterization of Finite Homomorphism-Homogeneous Oriented Graphs with Loops. Graphs and Combinatorics 31, 1613–1628 (2015). https://doi.org/10.1007/s00373-014-1435-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-014-1435-z