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

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 side 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 forest 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.

On Ramsey properties of classes with forbidden trees

“…For a (not necessarily finite) σ-structure H, define CSP(H) = {A : A h → H}. From [8,16] and the results of this paper, we can conclude:…”

“…This definition of regularity coincides with the one from [16]. In [8], however, a set F of trees is defined to be regular if ≈ has finitely many equivalence classes on all rooted σ-forests. Let us call such a set F EPTT-regular.…”