2009
DOI: 10.1007/s11083-009-9118-8
|View full text |Cite
|
Sign up to set email alerts
|

No Finite–Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs

Abstract: D denotes the homomorphism poset of finite directed graphs. An antichain duality is a pair F, D of antichains of D such that (F→) ∪ (→D) = D is a partition. A generalized duality pair in D is an antichain duality F, D with finite F and D. We give a simplified proof of the Foniok-Nešetřil-Tardif theorem for the special case D, which gave full description of the generalized duality pairs in D. Although there are many antichain dualities F, D with infinite D and F, we can show that there is no antichain duality F… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…This result can be proved from the Directed Sparse Incomparability Lemma, see [1,2]. We present a self contained proof instead.…”
Section: Why Forests?mentioning
confidence: 99%
See 2 more Smart Citations
“…This result can be proved from the Directed Sparse Incomparability Lemma, see [1,2]. We present a self contained proof instead.…”
Section: Why Forests?mentioning
confidence: 99%
“…This leaves open the question of finding or characterizing duality pairs with one side finite while the other an infinite antichain. Erdős and Soukup [2] proved that no such duality pair exists with the left side finite.…”
Section: Theorem 13 ([1]mentioning
confidence: 99%
See 1 more Smart Citation
“…A characterization of finite dualities in the category of relational structures is provided in [35,14]. The relationship between finite dualities and duality pairs has recently been reproved in the special case of digraphs [11] using the Directed Sparse Incomparability Lemma. Here we would like to point out that sparse incomparability is not necessary to achieve these results; in fact, much weaker assumptions suffice.…”
Section: Definementioning
confidence: 99%
“…However the antichains with the splitting property have a lot of structure. In [5] it is shown that in the case of directed graphs, such an antichain A = O ∪ D cannot have O finite and D infinite. The question of the existence of antichains with the splitting property A = O ∪ D with O infinite and D finite is answered positively in [6].…”
Section: Introductionmentioning
confidence: 99%