Labeled posets are universal

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of finite k-posets is shown to be a distributive lattice. Homomorphicity orders of finite k-posets and k-lattices are shown to be universal in the sense that every countable poset can be embedded into them. Labeled posets are represented by directed graphs, and a categorical isomorphism between k-posets and their digraph representations is established.

Original languageBritish English
Pages (from-to)493-506
Number of pages14
JournalEuropean Journal of Combinatorics
Volume29
Issue number2
DOIs
StatePublished - Feb 2008

Fingerprint

Dive into the research topics of 'Labeled posets are universal'. Together they form a unique fingerprint.

Cite this