We fully characterise the situations where the existence of a homomorphism from a digraph G to at least one of a finite set H of directed graphs is determined by a finite number of forbidden subgraphs. We prove that these situations, called generalised dualities, are characterised by the non-existence of a homomorphism to G from a finite set of forests. Furthermore, we characterise all finite maximal antichains in the partial order of directed graphs ordered by the existence of homomorphism. We show that these antichains correspond exactly to the generalised dualities. This solves a problem posed in [1]. Finally, we show that it is NP-hard to decide whether a finite set of digraphs forms a maximal antichain. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Foniok, J., Nešetřil, J., & Tardif, C. (2006). Generalised dualities and finite maximal antichains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4271 LNCS, pp. 27–36). Springer Verlag. https://doi.org/10.1007/11917496_3
Mendeley helps you to discover research relevant for your work.