Displaying similar documents to “Functions with preclosed graphs.”

Antichains in the homomorphism order of graphs

Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let 𝔾 and 𝔻 , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal...