{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T17:56:01Z","timestamp":1759341361039},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1007\/bf02579216","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:15:56Z","timestamp":1174598156000},"page":"161-168","source":"Crossref","is-referenced-by-count":18,"title":["Hypergraphs in which all disjoint pairs have distinct unions"],"prefix":"10.1007","volume":"4","author":[{"given":"Zolt\u00e1n","family":"F\u00fcredi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579216_CR1","unstructured":"Blanchard, Bull. Assoc. Proc. Math. No. 300 (1975), p. 538."},{"key":"BF02579216_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W. G. Brown","year":"1966","unstructured":"W. G. Brown, On graphs that do not contain a Thomsen graph,Bull. Canad. Math. Soc. 9 (1966), 281\u2013288.","journal-title":"Bull. Canad. Math. Soc."},{"key":"BF02579216_CR3","first-page":"74","volume":"2","author":"P. Erd\u00f6s","year":"1938","unstructured":"P. Erd\u00f6s, On sequences of integers no one of which divides the product of two others and on some related problems,Mitteilungen des Forschungsinstitutes f\u00fcr Math. und Mechanik, Tomsk 2 (1938), 74\u201382.","journal-title":"Mitteilungen des Forschungsinstitutes f\u00fcr Math. und Mechanik, Tomsk"},{"key":"BF02579216_CR4","unstructured":"P. Erd\u00f6s, Problems and results in combinatorial analysis,Proc. of the Eighth Southeastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge 1977, Louisiana State Univ.,Congr. Numerantium XIX, 3\u201312."},{"key":"BF02579216_CR5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0021-9800(68)80051-1","volume":"5","author":"P. Erd\u00f6s","year":"1968","unstructured":"P. Erd\u00f6s andD. J. Kleitman, On coloring graphs to maximize the proportion of multicoloredk-edges,J. Combinatorial Th. 5 (1968), 164\u2013169.","journal-title":"J. Combinatorial Th."},{"key":"BF02579216_CR6","first-page":"215","volume":"1","author":"P. Erd\u00f6s","year":"1966","unstructured":"P. Erd\u00f6s, A. R\u00e9nyi andV. T. S\u00f3s, On a problem in graph theory,Studia Sci. Math. Hungar. 1 (1966), 215\u2013235.","journal-title":"Studia Sci. Math. Hungar."},{"key":"BF02579216_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(84)90183-3","volume":"48","author":"P. Frankl","year":"1984","unstructured":"P. Frankl andZ. F\u00fcredi, A new extremal property of Steiner triple systems,Discrete Math.,48 (1984), 205\u2013212.","journal-title":"Discrete Math."},{"key":"BF02579216_CR8","unstructured":"P. Frankl andZ. F\u00fcredi, Union-free hypergraphs and equations over finite fields, to appear."},{"key":"BF02579216_CR9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02579190","volume":"3","author":"P. Frankl","year":"1983","unstructured":"P. Frankl andZ. F\u00fcredi, A new generalization of the Erd\u00f6s\u2014Ko\u2014Rado theorem,Combinatorica 3 (1983), 341\u2013349.","journal-title":"Combinatorica"},{"key":"BF02579216_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(83)90018-7","volume":"34","author":"Z. F\u00fcredi","year":"1983","unstructured":"Z. F\u00fcredi, Graphs without quadrilaterals,J. Comb. Th. B 34 (1983), 187\u2013190.","journal-title":"J. Comb. Th. B"},{"key":"BF02579216_CR11","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1214\/aoms\/1177700182","volume":"36","author":"H. Hanani","year":"1965","unstructured":"H. Hanani, A balanced incomplete block design,Ann. Math. Statist. 36 (1965), 711.","journal-title":"Ann. Math. Statist."},{"key":"BF02579216_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0167-5060(08)70715-5","volume":"6","author":"M. Simonovits","year":"1980","unstructured":"M. Simonovits andV. T. S\u00f3s, Intersection theorems on structures,Ann. Discrete Math. 6 (1980), 301\u2013313.","journal-title":"Ann. Discrete Math."},{"key":"BF02579216_CR13","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0097-3165(72)90028-3","volume":"13","author":"R. M. Wilson","year":"1972","unstructured":"R. M. Wilson, An existence theory for pairwise balanced designs I\u2013III.J. Combinatorial Th. A 13 (1972), 220\u2013273,18 (1973), 71\u201379.","journal-title":"J. Combinatorial Th. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579216.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579216\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:59Z","timestamp":1558197899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["BF02579216"],"URL":"https:\/\/doi.org\/10.1007\/bf02579216","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}