{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T01:11:58Z","timestamp":1750727518902},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":10182,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0095-8956(85)90043-7","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"134-145","source":"Crossref","is-referenced-by-count":40,"title":["Critical hypergraphs and intersecting set-pair systems"],"prefix":"10.1016","volume":"39","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(85)90043-7_BIB1","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\/0095-8956(85)90043-7_BIB2","first-page":"87","article-title":"Theorem on families of finite sets","volume":"12","author":"Calczinska-Karlowicz","year":"1964","journal-title":"Bull. Acad. Polon. Sci. Ser. Math. Astr. Phys."},{"key":"10.1016\/0095-8956(85)90043-7_BIB3","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0021-9045(73)90089-0","article-title":"Interpolation of functions over a measure space and conjectures about memory","volume":"9","author":"Ehrenfeucht","year":"1973","journal-title":"J. Approx. Theory"},{"key":"10.1016\/0095-8956(85)90043-7_BIB4","series-title":"Combinatorial Theory and Its Applications, Proc. of the Colloq.","first-page":"311","article-title":"On a lemma of Hainal-Folkman","author":"Erd\u00f6s","year":"1969"},{"key":"10.1016\/0095-8956(85)90043-7_BIB5","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\/0095-8956(85)90043-7_BIB6","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","article-title":"A problem in graph theory","volume":"71","author":"Erd\u00f6s","year":"1964","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0095-8956(85)90043-7_BIB7","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\/0095-8956(85)90043-7_BIB8","article-title":"Sur la th\u00e9orie extr\u00e9male des ensembles finis","author":"Frankl","year":"1980","journal-title":"thesis"},{"key":"10.1016\/0095-8956(85)90043-7_BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","article-title":"An extremal problem for two families of sets","volume":"3","author":"Frankl","year":"1982","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(85)90043-7_BIB10","unstructured":"Z. F\u00fcredi, Geometrical solution of an intersection problem for two hypergraphs, to appear."},{"key":"10.1016\/0095-8956(85)90043-7_BIB11","first-page":"135","article-title":"Neuer Beweis eines Tutteschen Satzes","volume":"8","author":"Gallai","year":"1963","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"10.1016\/0095-8956(85)90043-7_BIB12","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\/0095-8956(85)90043-7_BIB13","first-page":"221","article-title":"D\u00e9termination du nombre maximum d'arr\u00eates d'un hypergraphe \u03c4-critique","volume":"273","author":"Jaeger","year":"1971","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/0095-8956(85)90043-7_BIB14","series-title":"Combinatorics","first-page":"13","article-title":"Extremal problems for hypergraphs","volume":"Vol. 56","author":"Katona","year":"1974"},{"key":"10.1016\/0095-8956(85)90043-7_BIB15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0097-3165(74)90018-1","article-title":"Solution of a problem of A. Ehrenfeucht and J. Mycielski","volume":"17","author":"Katona","year":"1974","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0095-8956(85)90043-7_BIB16","first-page":"413","article-title":"\u03c4-critical hypergraphs and the Helly-property","volume":"17","author":"Lehel","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(85)90043-7_BIB17","series-title":"Finite and Infinite Sets","first-page":"567","article-title":"Multitransversals in \u03c4-critical hypergraphs","author":"Lehel","year":"1981"},{"key":"10.1016\/0095-8956(85)90043-7_BIB18","series-title":"Combinatorial Surveys","first-page":"45","article-title":"Flats in matroids and geometric graphs","author":"Lov\u00e1sz","year":"1977"},{"key":"10.1016\/0095-8956(85)90043-7_BIB19","first-page":"209","article-title":"On minimax theorems of combinatorics","volume":"26","author":"Lov\u00e1sz","year":"1975","journal-title":"Mat. Lapok"},{"key":"10.1016\/0095-8956(85)90043-7_BIB20","first-page":"363","article-title":"On a combinatorial problem I","volume":"7","author":"Szemer\u00e9di","year":"1972","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0095-8956(85)90043-7_BIB21","first-page":"203","article-title":"Complexity of lattice-configurations","volume":"10","author":"Tarj\u00e1n","year":"1975","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0095-8956(85)90043-7_BIB22","first-page":"205","article-title":"On the maximum number of vertices in n-uniform cliques","volume":"16A","author":"Hanson","year":"1983","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0095-8956(85)90043-7_BIB23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0195-6698(84)80032-3","article-title":"Helly-type hypergraphs and Sperner families","volume":"5","author":"Tuza","year":"1984","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(85)90043-7_BIB24","series-title":"Finite and Infinite Sets","first-page":"749","article-title":"The method of set-pairs for extremal problems in hypergraphs","author":"Tuza","year":"1981"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895685900437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895685900437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:56:16Z","timestamp":1548759376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895685900437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0095895685900437"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(85)90043-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}