{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:30:22Z","timestamp":1773235822442,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"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":[[1989,9]]},"DOI":"10.1016\/0097-3165(89)90064-2","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T15:09:06Z","timestamp":1096988946000},"page":"84-89","source":"Crossref","is-referenced-by-count":14,"title":["Minimum number of elements representing a set system of given rank"],"prefix":"10.1016","volume":"52","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(89)90064-2_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0097-3165(89)90064-2_BIB2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","article-title":"On generalized graphs","volume":"16","author":"Bollob\u00e1s","year":"1965","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0097-3165(89)90064-2_BIB3","first-page":"181","article-title":"On the maximal number of vertices representing the edges of a graph","volume":"6","author":"Erd\u00f6s","year":"1961","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"10.1016\/0097-3165(89)90064-2_BIB4","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(89)90064-2_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(82)90065-X","article-title":"Upper bound on the order of \u03c4-critical hypergraphs","volume":"33","author":"Gy\u00e1rf\u00e1s","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0097-3165(89)90064-2_BIB6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0095-8956(85)90043-7","article-title":"Critical hypergraphs and intersecting set-pair systems","volume":"39","author":"Tuza","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0097-3165(89)90064-2_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(87)90074-6","article-title":"On two intersecting set systems and k-continuous Boolean functions","volume":"16","author":"Tuza","year":"1987","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T07:28:40Z","timestamp":1549178920000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316589900642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0097316589900642"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(89)90064-2","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}