No finite-infinite antichain duality in the homomorphism poset of directed graphs (Q603883)

Let \(\mathbb{D}\) denote the homomorphism poset of finite directed graphs. An antichain duality is a pair \(\left\langle{\mathcal F},{\mathcal D}\right\rangle\) of antichains of \(\mathbb D\) such that \(({{\mathcal F}\to}) \cup ({\to{\mathcal D}}) = \mathbb D\) is a partition. A generalized duality pair in \(\mathbb{D}\) is an antichain duality \(\left\langle{\mathcal F},{\mathcal D}\right\rangle\) with finite \({\mathcal F}\) and \({\mathcal D}\). (See [\textit{D. Duffus}, \textit{P. L. Erdős}, \textit{J. Nešetřil}, and \textit{L. Soukup}, ``Antichains in the homomorphism order of graphs,'' Commentat. Math. Univ. Carol. 48, No.\,4, 571--583 (2007; Zbl 1199.06008)], where the study of antichain duality was initiated.) Here the authors give a simplified proof of the Foniok-Nešetřil--Tardif theorem for the special case \(\mathbb D\), which gave full description of the generalized duality pairs in \(\mathbb{D}\). (See [\textit{J. Foniok}, \textit{J. Nešetřil}, and \textit{C. Tardif}, ``Generalised dualities and maximal finite antichains in the homomorphism order of relational structures,'' Eur. J. Comb. 29, No.\,4, 881--899 (2008; Zbl 1147.05037)].) Although there are many antichain dualities \(\left\langle{\mathcal F},{\mathcal D}\right\rangle\) with infinite \({\mathcal D}\) and \({\mathcal F}\), they can show that there is no antichain duality \(\left\langle{\mathcal F},{\mathcal D}\right\rangle\) with finite \({\mathcal F}\) and infinite \({\mathcal D}\).