{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T20:13:29Z","timestamp":1712348009821},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0097-3165(91)90033-d","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"203-222","source":"Crossref","is-referenced-by-count":6,"title":["Posets with maximal M\u00f6bius function"],"prefix":"10.1016","volume":"56","author":[{"given":"G\u00fcnter M","family":"Ziegler","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(91)90033-D_BIB1","article-title":"Combinatorial Theory","volume":"Vol. 234","author":"Aigner","year":"1979"},{"key":"10.1016\/0097-3165(91)90033-D_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02392300","article-title":"An extended Euler-Poincar\u00e9 theorem","volume":"161","author":"Bj\u00f6rner","year":"1988","journal-title":"Acta Math."},{"key":"10.1016\/0097-3165(91)90033-D_BIB3","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0097-3165(91)90033-D_BIB4","series-title":"Studies in Combinatorics","first-page":"22","article-title":"Proof techniques in the theory of finite sets","volume":"Vol. 17","author":"Greene","year":"1978"},{"key":"10.1016\/0097-3165(91)90033-D_BIB5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Israel J. Math."},{"key":"10.1016\/0097-3165(91)90033-D_BIB6","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00531932","article-title":"On the foundations of combinatorial theory. I. Theory of M\u00f6bius functions","volume":"2","author":"Rota","year":"1964","journal-title":"Z. Wahrsch."},{"key":"10.1016\/0097-3165(91)90033-D_BIB7","volume":"Vol. I","author":"Stanley","year":"1986"},{"key":"10.1016\/0097-3165(91)90033-D_BIB8","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731659190033D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731659190033D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:23:33Z","timestamp":1548750213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731659190033D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["009731659190033D"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(91)90033-d","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}