Regular families of forests, antichains and duality pairs of relational structures

Péter L. Erdős, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both sides are infinite seems to be very complex. It is also known that no finite-infinite duality pair is possible if we make the additional restriction that both classes are antichains. In this paper we characterize the infinite-finite antichain dualities and infinite-finite dualities with trees or forests on the left hand side. This work builds on our earlier papers [6] that gave several examples of infinite-finite antichain duality pairs of directed graphs and [7] giving a complete characterization for caterpillar dualities.

Original languageEnglish
Pages (from-to)651-672
Number of pages22
JournalCombinatorica
Volume37
Issue number4
DOIs
Publication statusPublished - Aug 1 2017

Keywords

  • 05C05
  • 68Q19

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Regular families of forests, antichains and duality pairs of relational structures'. Together they form a unique fingerprint.

  • Cite this