Abstract
Consider a set of graphs and all the homomorphisms among them. Change each graph into a digraph by assigning directions to its edges. Some of the homomorphisms preserve the directions and so remain as homomorphisms of the set of digraphs; others do not. We study the relationship between the original set of graph-homomorphisms and the resulting set of digraph-homomorphisms and prove that they are in a certain sense independent. This independence result no longer holds if we start with a proper class of graphs, or if we require that only one direction be given to each edge (unless each homomorphism is invertible, in which case we again prove independence). We also specialize the results to the set consisting of one graph and prove the independence of monoids (groups) of a graph and the corresponding digraph.
Similar content being viewed by others
References
Hedrlín, Z., andA. Pultr: On the representation of small categories. Dokl. Akad. Nauk SSSR160, 284–286 (1965).
Hell, P., andJ. Nešetřil: Graphs andk-societies. Canad. Math. Bull.13, 375–381 (1970).
Hell, P.: Full embeddings into some categories of graphs. Alg. Univ.2, 129–141 (1972).
Hell, P.: On some strongly rigid families of graphs and the full embeddings they induce. Alg. Univ.4, 108–126 (1974).
Hell, P.: On some independence results in graph theory. Proceedings of the Conference on Algebraic Aspects of Combinatorics (D. Corneil and E. Mendelsohn eds.). University of Toronto, Utilitas Math. 1975, pp. 89–122.
Mitchell, B.: Theory of Categories. New York-London: Academic Press. 1965.
Nešetřil, J.: On symmetric and antisymmetric relations. Mh. Math.76, 323–327 (1972).
Author information
Authors and Affiliations
Additional information
With 1 Firgure
Rights and permissions
About this article
Cite this article
Hell, P., Nešetřil, J. Homomorphisms of graphs and of their orientations. Monatshefte für Mathematik 85, 39–48 (1978). https://doi.org/10.1007/BF01300959
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01300959