{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T03:09:13Z","timestamp":1785467353414,"version":"3.56.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,5,1]],"date-time":"1981-05-01T00:00:00Z","timestamp":357523200000},"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":11765,"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":[[1981,5]]},"DOI":"10.1016\/0097-3165(81)90029-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"331-334","source":"Crossref","is-referenced-by-count":32,"title":["Extending the Greene-Kleitman theorem to directed graphs"],"prefix":"10.1016","volume":"30","author":[{"given":"Nathan","family":"Linial","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(81)90029-7_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for finite partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math."},{"key":"10.1016\/0097-3165(81)90029-7_BIB2","series-title":"Theory of Graphs, Tihany","first-page":"115","article-title":"On directed paths and circuits","author":"Gallai","year":"1968"},{"key":"10.1016\/0097-3165(81)90029-7_BIB3","first-page":"181","article-title":"Verallgeneinerung eines graphentheoretischen Satzes von R\u00e9dei","volume":"21","author":"Gallai","year":"1960","journal-title":"Acta Sci. Math."},{"key":"10.1016\/0097-3165(81)90029-7_BIB4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","article-title":"The structure of Sperner k-families","volume":"20","author":"Greene","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0097-3165(81)90029-7_BIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(78)90007-9","article-title":"Covering digraphs by paths","volume":"23","author":"Linial","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(81)90029-7_BIB6","series-title":"Transversal Theory","author":"Mirsky","year":"1971"},{"key":"10.1016\/0097-3165(81)90029-7_BIB7","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 ordered sets","volume":"33","author":"Saks","year":"1979","journal-title":"Adv. in Math."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316581900297?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:56:12Z","timestamp":1548752172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316581900297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,5]]}},"alternative-id":["0097316581900297"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(81)90029-7","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1981,5]]}}}