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

This is a preview of subscription content, access via your institution.

References

  1. [1]

    A. Bulatov, A. Krokhin and B. Larose: Dualities for Constraint Satisfaction Problems, Complexity of Constraints (LNCS 5250) (2008), 93–124.

    Google Scholar 

  2. [2]

    C. Carvalho, V. Dalmau and A. Krokhin: Caterpillar Duality for Constraint Satisfaction Problems, in: Proceedings of the 23rd IEEE Symposium on Logic in Computer Science (LICS’ 08), 2008, 307–316.

    Google Scholar 

  3. [3]

    D. Duffus, P. L. Erdős, J. Nešetřil and L. Soukup: Antichains in the homomorphism order of graphs, Comment Math. Univ. Carol. 48 (4) (2007), 571–583.

    MathSciNet  MATH  Google Scholar 

  4. [4]

    P. L. Erdős and L. Soukup: How to split antichains in infinite posets, Combinatorica 27 (2007), 147–161.

    MathSciNet  Article  MATH  Google Scholar 

  5. [5]

    P. L. Erdős and L. Soukup: No finite-infinite antichain duality in the homomorphism poset of directed graphs, Order 27 (2010), 317–325.

    MathSciNet  Article  MATH  Google Scholar 

  6. [6]

    P. L. Erdős, C. Tardif and G. Tardos: On infinite-finite duality pairs of directed graphs, submitted (2012).

    Google Scholar 

  7. [7]

    P. L. Erdős, C. Tardif and G. Tardos: Caterpillar dualities and regular languages, submitted (2012).

    Google Scholar 

  8. [8]

    T. Feder and M. Y. Vardi: The Computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory, SIAM Journal of Computing 28 (1998), 57–104.

    MathSciNet  Article  MATH  Google Scholar 

  9. [9]

    J. Foniok, J. Nešetřil and C. Tardif: Generalized dualities and maximal finite antichains in the homomorphism order of relational structures, Europ. J. Comb 29 (2008), 881–899.

    Article  MATH  Google Scholar 

  10. [10]

    B. Larose, C. Loten and C. Tardif: A Characterisation of first order de finable constraint satisfaction problems, Log. Methods Comput. Sci. 3 (2007).

    Google Scholar 

  11. [11]

    L. Libkin: Logics for Unranked Trees: An Overview, Logical Methods in Computer Science 2 (2006).

    Google Scholar 

  12. [12]

    J. Nešetřil and C. Tardif: Duality theorems for finite structures (characterising gaps and good characterisations), J. Comb. Theory (B) 80 (2000), 80–97.

    MathSciNet  Article  MATH  Google Scholar 

  13. [13]

    J. Nešetřil and C. Tardif: Short answers to exponentially long questions: extremal aspects of homomorphism duality, SIAM J. Disc. Math. 19 (2005), 914–920.

    MathSciNet  Article  MATH  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Dömötör Pálvölgyi.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Erdős, P.L., Pálvölgyi, D., Tardif, C. et al. Regular families of forests, antichains and duality pairs of relational structures. Combinatorica 37, 651–672 (2017). https://doi.org/10.1007/s00493-015-3003-4

Download citation

Mathematics Subject Classification (2010)

  • 68Q19
  • 05C05