2010
DOI: 10.1007/s11083-010-9169-x
|View full text |Cite
|
Sign up to set email alerts
|

On the Homomorphism Order of Labeled Posets

Abstract: Abstract. Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism order of k-posets. Subla… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…Somewhat surprisingly, this order has received very little attention in the literature. In comparison, the homomorphism order, corresponding to the existence of any homomorphism between two structures, is much-studied ( [5], [10]), as are various related concepts such as the core of a graph ( [3]). …”
Section: Introductionmentioning
confidence: 99%
“…Somewhat surprisingly, this order has received very little attention in the literature. In comparison, the homomorphism order, corresponding to the existence of any homomorphism between two structures, is much-studied ( [5], [10]), as are various related concepts such as the core of a graph ( [3]). …”
Section: Introductionmentioning
confidence: 99%
“…The ordered set P G , which forms a bounded distributive lattice, is very complicated: every countable ordered set embeds into P G [16,32,20]. More generally, the homomorphism order has been studied for various categories of finite relational structures [25,24,10,23].…”
mentioning
confidence: 99%
“…[8,9,15,16]), and on universal partially ordered structures in general (see e.g. [10,4,6,12,13,7,11]).…”
mentioning
confidence: 99%