Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Generalised Dualities and Finite Maximal Antichains
verfasst von : Jan Foniok, Jaroslav Nešetřil, Claude Tardif
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We fully characterise the situations where the existence of a homomorphism from a digraph
G
to at least one of a finite set
$\mathcal{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.