{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:03:34Z","timestamp":1767992614077,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"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,3]]},"DOI":"10.1007\/bf02579155","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:16:21Z","timestamp":1174598181000},"page":"39-45","source":"Crossref","is-referenced-by-count":23,"title":["On disjointly representable sets"],"prefix":"10.1007","volume":"4","author":[{"given":"Peter","family":"Frankl","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579155_CR1","unstructured":"C. Berge,Graphs and Hypergraphs, North-Holland, 1973."},{"key":"BF02579155_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B. Bollob\u00e1s","year":"1965","unstructured":"B. Bollob\u00e1s, On generalized graphs,Acta Math. Hung. 16 (1965), 447\u2013452.","journal-title":"Acta Math. Hung."},{"key":"BF02579155_CR3","first-page":"283","volume":"18","author":"P. Erd\u0151s","year":"1967","unstructured":"P. Erd\u0151s, On bipartite subgraphs of a graph (in Hungarian),Matematikai Lapok 18 (1967), 283\u2013288.","journal-title":"Matematikai Lapok"},{"key":"BF02579155_CR4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0021-9800(68)80051-1","volume":"5","author":"P. Erd\u0151s","year":"1968","unstructured":"P. Erd\u0151s andD. J. Kleitmann, On coloring graphs to maximize the proportion of multicoloredk-edges,J. Combinatorial Th. 5 (1968), 164\u2013169.","journal-title":"J. Combinatorial Th."},{"key":"BF02579155_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P. Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s, Chao Ko andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (2),12 (1961), 313\u2013320.","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"BF02579155_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1017\/S1446788700005954","volume":"11","author":"P. Erd\u0151s","year":"1970","unstructured":"P. Erd\u0151s andL. Moser, An extremal problem in graph theory,J. Austral. Math. Soc. 11 (1970), 42\u201347.","journal-title":"J. Austral. Math. Soc."},{"key":"BF02579155_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s andR. Rado, Intersection theorems for systems of sets,J. London Math. Soc. 35 (1960), 85\u201390.","journal-title":"J. London Math. Soc."},{"key":"BF02579155_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0097-3165(83)90038-9","volume":"34","author":"P. Frankl","year":"1983","unstructured":"P. Frankl, On the trace of finite sets,J. Combinatorial Th. Ser. A,34 (1983), 41\u201345.","journal-title":"J. Combinatorial Th. Ser. A"},{"key":"BF02579155_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0195-6698(83)80004-3","volume":"4","author":"P. Frankl","year":"1983","unstructured":"P. Frankl andJ. Pach, On the number of sets in a null-t-design,European J. Comb. 4 (1983), 21\u201333.","journal-title":"European J. Comb."},{"key":"BF02579155_CR10","first-page":"221","volume":"273","author":"F. Jaeger","year":"1971","unstructured":"F. Jaeger andC. Payan, Determination du nombre d\u2019aretes d\u2019un hypergraphe \u03c4-critique,C. R. Acad. Sc. Paris 273 (1971), 221\u2013223.","journal-title":"C. R. Acad. Sc. Paris"},{"key":"BF02579155_CR11","unstructured":"A. Hajnal, Personal communication."},{"key":"BF02579155_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0097-3165(74)90018-1","volume":"17","author":"G. O. H. Katona","year":"1974","unstructured":"G. O. H. Katona, Solution of a problem of A. Ehrenfeucht and J. Mycielsky,J. Comb. Th. 17 (1974), 265\u2013266.","journal-title":"J. Comb. Th."},{"key":"BF02579155_CR13","first-page":"228","volume":"15","author":"G. Katona","year":"1964","unstructured":"G. Katona, T. Nemetz andM. Simonovits, On a graph problem of Tur\u00e1n (in Hungarian),Matematikai Lapok 15 (1964), 228\u2013238.","journal-title":"Matematikai Lapok"},{"key":"BF02579155_CR14","first-page":"1","volume-title":"Graph Theory and Related topics","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, Topological and algebraic methods in graph theory, in:Graph Theory and Related topics (J. A. Bondy and U. S. R. Murty, eds.), Academic Press, New York 1979, 1\u201314."},{"key":"BF02579155_CR15","unstructured":"V. R\u00f6dl, Almost Steiner systems always exist,to appear in European J. of Comb."},{"key":"BF02579155_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"N. Sauer, On the density of families of sets,J. Combinatorial Th. Ser. A,13 (1972), 145\u2013147.","journal-title":"J. Combinatorial Th. Ser. A"},{"key":"BF02579155_CR17","first-page":"117","volume-title":"Voprosi Kibernetiki, Komb. Anal. i Teoria Grafov","author":"A. F. Sidorenko","year":"1980","unstructured":"A. F. Sidorenko, On the Tur\u00e1n numberT(n, 5, 4) and on the number of monochromatic 4-cliques in a two-coloured 3-graph (in Russian),Voprosi Kibernetiki, Komb. Anal. i Teoria Grafov, Nauka, Moscow 1980, 117\u2013124."},{"key":"BF02579155_CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","volume":"3","author":"P. Tur\u00e1n","year":"1954","unstructured":"P. Tur\u00e1n, On the theory of graphs,Coll. Math. 3 (1954), 19\u201330.","journal-title":"Coll. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579155.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579155\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:58Z","timestamp":1558197898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["BF02579155"],"URL":"https:\/\/doi.org\/10.1007\/bf02579155","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}