{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:20Z","timestamp":1759335800955},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"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":[[2009,7]]},"DOI":"10.1007\/s00493-009-2332-6","type":"journal-article","created":{"date-parts":[[2010,8,3]],"date-time":"2010-08-03T07:22:08Z","timestamp":1280820128000},"page":"389-431","source":"Crossref","is-referenced-by-count":5,"title":["Uniformly cross intersecting families"],"prefix":"10.1007","volume":"29","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Lubetzky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,4]]},"reference":[{"key":"2332_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-8858(89)90004-3","volume":"10","author":"R. Ahlswede","year":"1989","unstructured":"R. Ahlswede, N. Cai and Z. Zhang: A general 4-words inequality with consequences for 2-way communication complexity, Adv. in Appl. Math. 10 (1989), 75\u201394.","journal-title":"Adv. in Appl. Math."},{"key":"2332_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"N. Alon and J. H. Spencer: The Probabilistic Method, Second Edition, Wiley, New York, 2000.","edition":"Second Edition"},{"key":"2332_CR3","unstructured":"L. Babai and P. Frankl: Linear Algebra Methods in Combinatorics, Preliminary Version 2, Dept. of Computer Science, The Univesity of Chicago, 1992."},{"key":"2332_CR4","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1090\/S0002-9904-1945-08454-7","volume":"51","author":"P. Erd\u0151s","year":"1945","unstructured":"P. Erd\u0151s: On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. (2nd ser.) 51 (1945), 898\u2013902.","journal-title":"Bull. Amer. Math. Soc. (2nd ser.)"},{"key":"2332_CR5","series-title":"Congressus Numerantium","first-page":"169","volume-title":"Proc. of the Fifth British Comb. Conf. 1975 Aberdeen","author":"P. Erd\u0151s","year":"1976","unstructured":"P. Erd\u0151s: Problems and results in graph theory and combinatorial analysis, in: Proc. of the Fifth British Comb. Conf. 1975 Aberdeen, pp. 169\u2013192, Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976."},{"key":"2332_CR6","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, C. Ko and R. Rado: Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. 2 12 (1961), 313\u2013320.","journal-title":"Quart. J. Math. Oxford Ser. 2"},{"key":"2332_CR7","first-page":"1293","volume-title":"Handbook of Combinatorics, Vol. 1, 2","author":"P. Frankl","year":"1995","unstructured":"P. Frankl: Extremal set systems, in: R. L. Graham, M. Gr\u00f6tschel, L. Lov\u00e1sz (eds.), Handbook of Combinatorics, Vol. 1, 2, pp. 1293\u20131329, Elsevier, Amsterdam, 1995."},{"issue":"2","key":"2332_CR8","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0097-3165(85)90035-4","volume":"39","author":"P. Frankl","year":"1985","unstructured":"P. Frankl and Z. F\u00fcredi: Forbidding just one intersection, J. Combin. Theory Ser. A 39(2) (1985), 160\u2013176.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2332_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1090\/S0002-9947-1987-0871675-6","volume":"300","author":"P. Frankl","year":"1987","unstructured":"P. Frankl and V. R\u00f6dl: Forbidden intersections, Trans. Amer. Math. Soc. 300 (1987), 259\u2013286.","journal-title":"Trans. Amer. Math. Soc"},{"issue":"4","key":"2332_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579457","volume":"1","author":"P. Frankl","year":"1981","unstructured":"P. Frankl and R. M. Wilson: Intersection theorems with geometric consequences, Combinatorica 1(4) (1981), 357\u2013368.","journal-title":"Combinatorica"},{"key":"2332_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01897141","volume":"15","author":"G. Katona","year":"1964","unstructured":"G. Katona: Intersection theorems for systems of finite sets, Acta Math. Acad. Sci. Hungar. 15 (1964), 329\u2013337.","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"2332_CR12","doi-asserted-by":"crossref","first-page":"1536","DOI":"10.1016\/j.jcta.2005.10.008","volume":"113","author":"P. Keevash","year":"2006","unstructured":"P. Keevash and B. Sudakov: On a restricted cross-intersection problem, J. Combinatorial Theory Ser. A 113 (2006), 1536\u20131542.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"2332_CR13","first-page":"277","volume":"12","author":"J. Littlewood","year":"1943","unstructured":"J. Littlewood and C. Offord: On the number of real roots of a random algebraic equation III, Mat. Sbornik 12 (1943), 277\u2013285.","journal-title":"Mat. Sbornik"},{"key":"2332_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(66)80035-2","volume":"1","author":"D. Lubell","year":"1966","unstructured":"D. Lubell: A short proof of Sperner\u2019s theorem, Journal of Combinatorial Theory 1 (1966), 299.","journal-title":"Journal of Combinatorial Theory"},{"key":"2332_CR15","first-page":"737","volume":"12","author":"D. K. Ray-Chaudhuri","year":"1975","unstructured":"D. K. Ray-Chaudhuri and R. M. Wilson: On t-designs, Osaka J. Math. 12 (1975), 737\u2013744.","journal-title":"Osaka J. Math"},{"key":"2332_CR16","first-page":"26","volume":"62","author":"H. Robbins","year":"1955","unstructured":"H. Robbins: A remark on Stirling\u2019s formula, Amer. Math. Monthly 62 (1955), 26\u201329.","journal-title":"Amer. Math. Monthly"},{"issue":"4","key":"2332_CR17","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s004939970007","volume":"19","author":"J. Sgall","year":"1999","unstructured":"J. Sgall: Bounds on pairs of families with restricted intersections, Combinatorica 19(4) (1999), 555\u2013566.","journal-title":"Combinatorica"},{"key":"2332_CR18","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"E. Sperner: Ein Satz \u00fcber Untermengen einer endlichen Menge, Math. Z. 27 (1928), 544\u2013548.","journal-title":"Math. Z"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2332-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2332-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2332-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:46Z","timestamp":1559093566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2332-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["2332"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2332-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7]]}}}