{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T23:30:24Z","timestamp":1770766224678,"version":"3.50.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"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":12130,"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":[[1980,5]]},"DOI":"10.1016\/0097-3165(80)90071-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"282-289","source":"Crossref","is-referenced-by-count":27,"title":["On maximal intersecting families of finite sets"],"prefix":"10.1016","volume":"28","author":[{"given":"Zolt\u00e1n","family":"F\u00fcredi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(80)90071-0_BIB1","series-title":"Proceedings, Fifth British Combinatorial Conference, Aberdeen, 1975","first-page":"169","article-title":"Problems and results in graph theory and combinatorial analysis","author":"Erd\u00f6s","year":"1976"},{"key":"10.1016\/0097-3165(80)90071-0_BIB2_1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(74)90140-X","article-title":"Extremal problems among subsets of a set","volume":"8","author":"Erd\u00f6s","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(80)90071-0_BIB2_2","series-title":"Proceedings Second Chapel Hill Conference, University of North Carolina","first-page":"146","author":"Erd\u00f6s","year":"1970"},{"key":"10.1016\/0097-3165(80)90071-0_BIB3","series-title":"Infinite and Finite sets","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"Vol. 10","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0097-3165(80)90071-0_BIB4","series-title":"Proceedings, Hypergraph Seminar, Columbus, Ohio, 1972","first-page":"127","article-title":"Quelques probl\u00e8mes concernant les cliques des hypergraphes h-complets et q-parti h-complets","author":"Meyer","year":"1974"},{"key":"10.1016\/0097-3165(80)90071-0_BIB5","series-title":"Proceedings, Hypergraph Seminar, Columbus, Ohio, 1972","first-page":"285","article-title":"23rd unsolved problem","author":"Meyer","year":"1974"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316580900710?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316580900710?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:57:57Z","timestamp":1548752277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316580900710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["0097316580900710"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(80)90071-0","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}