{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:35:36Z","timestamp":1769970936108,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1007\/bf01788531","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T14:38:32Z","timestamp":1119191912000},"page":"75-80","source":"Crossref","is-referenced-by-count":16,"title":["Inequalities for two set systems with prescribed intersections"],"prefix":"10.1007","volume":"3","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01788531_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0195-6698(85)80029-9","volume":"6","author":"N. Alon","year":"1985","unstructured":"Alon, N., Kalai, G.: A simple proof of the upper bound theorem. Europ. J. Comb.6, 211\u2013214 (1985)","journal-title":"Europ. J. Comb."},{"key":"BF01788531_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(75)90046-1","volume":"12","author":"B. Alspach","year":"1975","unstructured":"Alspach, B., Ollmann, O.T., Reid, K.B.: Mutually disjoint families of 0\u20131 sequences. Discrete Math.12, 205\u2013209 (1975)","journal-title":"Discrete Math."},{"key":"BF01788531_CR3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B. Bollob\u00e1s","year":"1965","unstructured":"Bollob\u00e1s, B.: On generalized graphs. Acta Math. Acad. Sci. Hung.16, 447\u2013452 (1965)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF01788531_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P. Frankl","year":"1982","unstructured":"Frankl, P.: An extremal problem for two families of sets. Europ. J. Comb.3, 125\u2013127 (1982)","journal-title":"Europ. J. Comb."},{"key":"BF01788531_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0012-365X(85)80009-1","volume":"55","author":"Z. F\u00fcredi","year":"1985","unstructured":"F\u00fcredi, Z., Tuza, Zs.: Hypergraphs without a large star. Discrete Math.55, 317\u2013321 (1985)","journal-title":"Discrete Math."},{"key":"BF01788531_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02761162","volume":"48","author":"G. Kalai","year":"1984","unstructured":"Kalai, G.: Intersection patterns of convex sets. Isr. J. Math.48, 161\u2013174 (1984)","journal-title":"Isr. J. Math."},{"key":"BF01788531_CR7","first-page":"23","volume":"2","author":"G.O.H. Katona","year":"1967","unstructured":"Katona, G.O.H., Szemer\u00e9di, E.: On a problem of graph theory. Stud. Sci. Math. Hung.2, 23\u201328 (1967)","journal-title":"Stud. Sci. Math. Hung."},{"key":"BF01788531_CR8","first-page":"253","volume":"20","author":"M.A. Perles","year":"1984","unstructured":"Perles, M.A.: At most 2 d+1 neighborly simplices in E d . Ann. Discrete Math.20, 253\u2013254 (1984)","journal-title":"Ann. Discrete Math."},{"key":"BF01788531_CR9","first-page":"535","volume":"17","author":"E. Pin","year":"1983","unstructured":"Pin, E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math.17, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"key":"BF01788531_CR10","first-page":"203","volume":"10","author":"T.G. Tarj\u00e1n","year":"1975","unstructured":"Tarj\u00e1n, T.G.: Complexity of lattice-configurations. Stud. Sci. Math. Hung.10, 203\u2013211 (1975)","journal-title":"Stud. Sci. Math. Hung."},{"key":"BF01788531_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0195-6698(84)80032-3","volume":"5","author":"Zs. Tuza","year":"1984","unstructured":"Tuza, Zs.: Helly-type hypergraphs and Sperner families. Europ J. Comb.5, 185\u2013187 (1984)","journal-title":"Europ J. Comb."},{"key":"BF01788531_CR12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0095-8956(85)90043-7","volume":"39","author":"Zs. Tuza","year":"1985","unstructured":"Tuza, Zs.: Critical hypergraphs and intersecting set-pair systems. J. Comb. Theory (B)39, 134\u2013145 (1985)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01788531_CR13","unstructured":"Tuza, Zs.: Intersection properties and extremal problems for set systems (to appear)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788531.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788531\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T09:56:50Z","timestamp":1557395810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["BF01788531"],"URL":"https:\/\/doi.org\/10.1007\/bf01788531","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}