Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

Antichains in the homomorphism order of graphs

Dwight DuffusPeter, L. ErdösJaroslav NešetřilLajos Soukup — 2007

Commentationes Mathematicae Universitatis Carolinae

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 antichains...

Page 1

Download Results (CSV)