Homomorphism-homogeneous L-colored graphs

Details Homomorphism-homogeneous L-colored graphs Homomorphism-homogeneous L-colored graphs

2012-04-26

arxiv.org/abs/1204.5879v1

Mathematics

Combinatorics

Submitted to European Journal of Combinatorics

Scientific paper

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 to be much more involved. We show that in the general case the classes MH and HH do not coincide.

Affiliated with

Also associated with

No associations

Rating

Homomorphism-homogeneous L-colored graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Homomorphism-homogeneous L-colored graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homomorphism-homogeneous L-colored graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314204