{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T12:07:10Z","timestamp":1657541230867},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":11247,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0304-3975(82)90091-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"99-103","source":"Crossref","is-referenced-by-count":2,"title":["A solution of the Sperner-Erd\u00f6s problem"],"prefix":"10.1016","volume":"21","author":[{"given":"X.","family":"Berenguer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.H.","family":"Harper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90091-3_BIB1","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1090\/S0002-9904-1945-08454-7","article-title":"On a lemma of Littlewood and Offord","volume":"51","author":"Erd\u00f6s","year":"1945","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(82)90091-3_BIB2","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0304-3975(82)90091-3_BIB3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0304-3975(82)90091-3_BIB4","first-page":"701","article-title":"Note on Dilworth's decomposition theorem for partially ordered sets","volume":"7","author":"Fulkerson","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(82)90091-3_BIB5","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(82)90091-3_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Columbic","year":"1980"},{"key":"10.1016\/0304-3975(82)90091-3_BIB7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0097-3165(74)90027-2","article-title":"The morphology of partially ordered sets","volume":"17","author":"Harper","year":"1974","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0304-3975(82)90091-3_BIB8","doi-asserted-by":"crossref","unstructured":"L.H. Harper, The global theory of flows in networks, Advances Appl. Math. 1, to appear.","DOI":"10.1016\/0196-8858(80)90009-3"},{"key":"10.1016\/0304-3975(82)90091-3_BIB9","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","article-title":"Ein Satz \u00fcber Untermengen einer endlichen Menge","volume":"27","author":"Sperner","year":"1928","journal-title":"Math. Z."},{"key":"10.1016\/0304-3975(82)90091-3_BIB10","series-title":"Combinatorial Algorithms","author":"Wilf","year":"1975"},{"key":"10.1016\/0304-3975(82)90091-3_BIB11","first-page":"1510","article-title":"Finite partially ordered sets and Young tableaux","volume":"19","author":"Fomin","year":"1978","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(82)90091-3_BIB12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0001-8708(79)90010-0","article-title":"A short proof of the existence of k-saturated partitions of partially order sets","volume":"33","author":"Saks","year":"1979","journal-title":"Advances Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900913?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900913?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:19:33Z","timestamp":1580894373000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0304397582900913"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90091-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}