{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:46:07Z","timestamp":1780386367406,"version":"3.54.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976,1]]},"DOI":"10.1016\/0097-3165(76)90073-x","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"1-11","source":"Crossref","is-referenced-by-count":68,"title":["On Sperner families satisfying an additional condition"],"prefix":"10.1016","volume":"20","author":[{"given":"P","family":"Frankl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(76)90073-X_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(72)90054-8","article-title":"A simple proof of the Erd\u00f6s-Chao-Ko-Rado theorem","volume":"13","author":"Katona","year":"1972","journal-title":"J. Combinatorial Theory B"},{"key":"10.1016\/0097-3165(76)90073-X_BIB2","series-title":"Theory of Graphs Proc. Coll. held at Tihany","first-page":"187","article-title":"A theorem of finite sets","author":"Katona","year":"1968"},{"key":"10.1016\/0097-3165(76)90073-X_BIB3","series-title":"Mathematical Optimization Techniques","first-page":"251","article-title":"The Number of Simplicies in a Complex","author":"Kruskal","year":"1963"},{"key":"10.1016\/0097-3165(76)90073-X_BIB4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","article-title":"A short proof of Sperner's lemma","volume":"1","author":"Lubell","year":"1966","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(76)90073-X_BIB5","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1112\/jlms\/s1-43.1.204","article-title":"A combinatorial theorem on systems of sets","volume":"43","author":"Milner","year":"1968","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0097-3165(76)90073-X_BIB6","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."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731657690073X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731657690073X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:25:19Z","timestamp":1549099519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731657690073X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["009731657690073X"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(76)90073-x","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}