Homomorphism-homogeneous L-colored graphs
David Hartman, Jan Hubicka, Dragan Masulovic

TL;DR
This paper classifies finite monomorphism-homogeneous L-colored graphs for chain-labeled sets and explores the relationship between homomorphism-homogeneity and monomorphism-homogeneity in different L structures.
Contribution
It provides a complete classification of finite MH-homogeneous L-colored graphs when L is a chain and analyzes the differences between MH and HH classes for diamond-shaped L.
Findings
MH and HH classes coincide when L is a chain.
MH and HH classes do not coincide when L is a diamond.
Classification results for L-colored graphs based on the structure of L.
Abstract
A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a structure is monomorphism-homogeneous (MH-homogeneous for short) if every monomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. In this paper we consider L-colored graphs, that is, undirected graphs without loops where sets of colors selected from L are assigned to vertices and edges. A full classification of finite MH-homogeneous L-colored graphs where L is a chain is provided, and we show that the classes MH and HH coincide. When L is a diamond, that is, a set of pairwise incomparable elements enriched with a greatest and a least element, the situation turns out…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Graph Theory Research · semigroups and automata theory
