{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:05:31Z","timestamp":1772445931994,"version":"3.50.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2001,5,24]],"date-time":"2001-05-24T00:00:00Z","timestamp":990662400000},"content-version":"unspecified","delay-in-days":84,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2001,3]]},"abstract":"<jats:p>In 1978, Dhar suggested a model of a lattice gas whose states are partial orders. In this \ncontext he raised the question of determining the number of partial orders with a fixed \nnumber of comparable pairs. Dhar conjectured that in order to find a good approximation \nto this number, it should suffice to enumerate families of layer posets. In this paper we \nprove this conjecture and thereby prepare the ground for a complete answer to the question.<\/jats:p>","DOI":"10.1017\/s0963548301004503","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:17:11Z","timestamp":1027761431000},"page":"159-177","source":"Crossref","is-referenced-by-count":5,"title":["Counting Partial Orders with a Fixed Number of Comparable Pairs"],"prefix":"10.1017","volume":"10","author":[{"given":"HANS J\u00dcRGEN","family":"PR\u00d6MEL","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANGELIKA","family":"STEGER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANUSCH","family":"TARAZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2001,5,24]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548301004503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T15:31:20Z","timestamp":1554046280000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548301004503\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0963548301004503"],"URL":"https:\/\/doi.org\/10.1017\/s0963548301004503","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}