{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:42:21Z","timestamp":1777434141368,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00493-015-3003-4","type":"journal-article","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T01:43:15Z","timestamp":1462844595000},"page":"651-672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Regular families of forests, antichains and duality pairs of relational structures"],"prefix":"10.1007","volume":"37","author":[{"given":"P\u00e9ter L.","family":"Erd\u0151s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Tardif","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"3003_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-92800-3_5","volume-title":"Complexity of Constraints (LNCS 5250)","author":"A. Bulatov","year":"2008","unstructured":"A. Bulatov, A. Krokhin and B. Larose: Dualities for Constraint Satisfaction Problems, Complexity of Constraints (LNCS 5250) (2008), 93\u2013124."},{"key":"3003_CR2","first-page":"307","volume-title":"Proceedings of the 23rd IEEE Symposium on Logic in Computer Science (LICS\u2019 08)","author":"C. Carvalho","year":"2008","unstructured":"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\u2019 08), 2008, 307\u2013316."},{"issue":"4","key":"3003_CR3","first-page":"571","volume":"48","author":"D. Duffus","year":"2007","unstructured":"D. Duffus, P. L. Erd\u0151s, J. Ne\u0161et\u0159il and L. Soukup: Antichains in the homomorphism order of graphs, Comment Math. Univ. Carol.\n48 (4) (2007), 571\u2013583.","journal-title":"Comment Math. Univ. Carol."},{"key":"3003_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00493-007-0048-z","volume":"27","author":"P. L. Erd\u0151s","year":"2007","unstructured":"P. L. Erd\u0151s and L. Soukup: How to split antichains in infinite posets, Combinatorica\n27 (2007), 147\u2013161.","journal-title":"Combinatorica"},{"key":"3003_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s11083-009-9118-8","volume":"27","author":"P. L. Erd\u0151s","year":"2010","unstructured":"P. L. Erd\u0151s and L. Soukup: No finite-infinite antichain duality in the homomorphism poset of directed graphs, Order\n27 (2010), 317\u2013325.","journal-title":"Order"},{"key":"3003_CR6","volume-title":"On infinite-finite duality pairs of directed graphs","author":"P. L. Erd\u0151s","year":"2012","unstructured":"P. L. Erd\u0151s, C. Tardif and G. Tardos: On infinite-finite duality pairs of directed graphs, submitted (2012)."},{"key":"3003_CR7","volume-title":"Caterpillar dualities and regular languages","author":"P. L. Erd\u0151s","year":"2012","unstructured":"P. L. Erd\u0151s, C. Tardif and G. Tardos: Caterpillar dualities and regular languages, submitted (2012)."},{"key":"3003_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"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\n28 (1998), 57\u2013104.","journal-title":"SIAM Journal of Computing"},{"key":"3003_CR9","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/j.ejc.2007.11.017","volume":"29","author":"J. Foniok","year":"2008","unstructured":"J. Foniok, J. Ne\u0161et\u0159il and C. Tardif: Generalized dualities and maximal finite antichains in the homomorphism order of relational structures, Europ. J. Comb\n29 (2008), 881\u2013899.","journal-title":"Europ. J. Comb"},{"key":"3003_CR10","volume-title":"Log. Methods Comput. Sci.","author":"B. Larose","year":"2007","unstructured":"B. Larose, C. Loten and C. Tardif: A Characterisation of first order de finable constraint satisfaction problems, Log. Methods Comput. Sci.\n3 (2007).","edition":"3"},{"key":"3003_CR11","volume-title":"Logical Methods in Computer Science","author":"L. Libkin","year":"2006","unstructured":"L. Libkin: Logics for Unranked Trees: An Overview, Logical Methods in Computer Science\n2 (2006).","edition":"2"},{"key":"3003_CR12","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1006\/jctb.2000.1970","volume":"80","author":"J. Ne\u0161et\u0159il","year":"2000","unstructured":"J. Ne\u0161et\u0159il and C. Tardif: Duality theorems for finite structures (characterising gaps and good characterisations), J. Comb. Theory (B)\n80 (2000), 80\u201397.","journal-title":"J. Comb. Theory (B)"},{"key":"3003_CR13","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1137\/S0895480104445630","volume":"19","author":"J. Ne\u0161et\u0159il","year":"2005","unstructured":"J. Ne\u0161et\u0159il and C. Tardif: Short answers to exponentially long questions: extremal aspects of homomorphism duality, SIAM J. Disc. Math.\n19 (2005), 914\u2013920.","journal-title":"SIAM J. Disc. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3003-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3003-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3003-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3003-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:51Z","timestamp":1559093571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3003-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3003"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3003-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}