{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T21:10:40Z","timestamp":1768770640275,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T00:00:00Z","timestamp":1218499200000},"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":[[2008,9]]},"DOI":"10.1007\/s00493-008-2318-9","type":"journal-article","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T04:05:22Z","timestamp":1218513922000},"page":"503-528","source":"Crossref","is-referenced-by-count":48,"title":["On the measure of intersecting families, uniqueness and stability"],"prefix":"10.1007","volume":"28","author":[{"given":"Ehud","family":"Friedgut","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,12]]},"reference":[{"key":"2318_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/eujc.1995.0092","volume":"182","author":"R. Ahlswede","year":"1997","unstructured":"R. Ahlswede and L. Khachatrian: The complete intersection theorem for systems of finite sets, European J. Combin. 18(2) (1997), 125\u2013136.","journal-title":"European J. Combin."},{"issue":"5","key":"2318_CR2","first-page":"913","volume":"14","author":"N. Alon","year":"2004","unstructured":"N. Alon, I. Dinur, E. Friedgut and B. Sudakov: Graph Products, Fourier Analysis and Spectral Techniques; G.A.F.A. 14(5) (2004), 913\u2013940.","journal-title":"G.A.F.A."},{"key":"2318_CR3","volume-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"N. Alon","year":"2000","unstructured":"N. Alon and J. Spencer: The probabilistic method, Second edition, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience [John Wiley and Sons], New York, 2000.","edition":"2"},{"key":"2318_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02785861","volume":"131","author":"J. Bourgain","year":"2002","unstructured":"J. Bourgain: On the distribution of the Fourier spectrum of boolean functions, Israel J. Math. 131 (2002), 269\u2013276.","journal-title":"Israel J. Math."},{"key":"2318_CR5","series-title":"Math. Centre Tracts","first-page":"139","volume-title":"Combinatorics (Proc. NATO Advanced Study Inst., Breukelen, 1974), Part 1: Theory of designs, finite geometry and coding theory","author":"P. Delsarte","year":"1974","unstructured":"P. Delsarte: The association schemes of coding theory, in: Combinatorics (Proc. NATO Advanced Study Inst., Breukelen, 1974), Part 1: Theory of designs, finite geometry and coding theory, pp. 139\u2013157. Math. Centre Tracts, No. 55, Math.Centrum, Amsterdam, 1974."},{"key":"2318_CR6","unstructured":"I. Dinur and E. Friedgut: Intersecting families are approximately contained in juntas, in preparation."},{"key":"2318_CR7","doi-asserted-by":"crossref","unstructured":"I. Dinur and E. Friedgut: A proof of an intersection theorem via graph homomorphisms, Electron. J. Comb. 13(1) (2006), #N6.","DOI":"10.37236\/1144"},{"key":"2318_CR8","doi-asserted-by":"crossref","unstructured":"I. Dinur, E. Friegut and O. Regev: Independent sets in graph powers are almost contained in juntas, to appear in G.A.F.A. http:\/\/dx.doi.org\/10.1007\/s00039-008-0651-1","DOI":"10.1007\/s00039-008-0651-1"},{"key":"2318_CR9","doi-asserted-by":"crossref","unstructured":"I. Dinur and S. Safra: On the importance of being biased (1.36 hardness of approximating Vertex-Cover), Annals of Mathematics, to appear. Proc. of 34th STOC, 2002.","DOI":"10.1145\/509907.509915"},{"key":"2318_CR10","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\u2013318.","journal-title":"Quart. J. Math. Oxford, Ser. 2"},{"issue":"1","key":"2318_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0607009","volume":"7","author":"P. C. Fishburn","year":"1986","unstructured":"P. C. Fishburn, P. Frankl, D. Freed, J. C. Lagarias and A. M. Odlyzko: Probabilities for intersecting systems and random subsets of finite sets, SIAM J. Algebraic Discrete Methods 7(1) (1986), 73\u201379.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2318_CR12","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"365","volume-title":"Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)","author":"P. Frankl","year":"1978","unstructured":"P. Frankl: The Erd\u0151s-Ko-Rado theorem is true for n = ckt, in: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp. 365\u2013375, Colloq. Math. Soc. J\u00e1nos Bolyai, 18, North-Holland, Amsterdam-New York, 1978."},{"issue":"2","key":"2318_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0097-3165(78)90003-1","volume":"24","author":"P. Frankl","year":"1978","unstructured":"P. Frankl: On intersecting families of finite sets, J. Combin. Theory Ser. A 24(2) (1978), 146\u2013161.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"2318_CR14","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0097-3165(91)90031-B","volume":"56","author":"P. Frankl","year":"1991","unstructured":"P. Frankl and Z. F\u00fcredi: Beyond the Erd\u0151s-Ko-Rado theorem, J. Combin. Theory Ser. A 56(2) (1991), 182\u2013194.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"2318_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF02579260","volume":"6","author":"P. Frankl","year":"1986","unstructured":"P. Frankl and Z. F\u00fcredi: Finite projective spaces and intersecting hypergraphs, Combinatorica 6(4) (1986), 335\u2013354.","journal-title":"Combinatorica"},{"issue":"3","key":"2318_CR16","first-page":"287","volume":"40","author":"P. Frankl","year":"2003","unstructured":"P. Frankl and N. Tokushige: Weighted multiply intersecting families, Studia Sci. Math. Hungar. 40(3) (2003), 287\u2013291.","journal-title":"Studia Sci. Math. Hungar."},{"issue":"2","key":"2318_CR17","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.jcta.2004.12.004","volume":"111","author":"E. Friedgut","year":"2005","unstructured":"E. Friedgut: A Katona-type proof of an Erd?os-Ko-Rado-type theorem, J. Combin. Theory Ser. A 111(2) (2005), 239\u2013244.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2318_CR18","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0196-8858(02)00024-6","volume":"29","author":"E. Friedgut","year":"2002","unstructured":"E. Friedgut, A. Naor and G. Kalai: Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels, Adv. in Appl. Math. 29 (2002), 427\u2013437.","journal-title":"Adv. in Appl. Math."},{"key":"2318_CR19","first-page":"177","volume-title":"Algebraic methods in graph theory","author":"Z. F\u00fcredi","year":"1981","unstructured":"Z. F\u00fcredi: Erd\u0151s-Ko-Rado type theorems with upper bounds on the maximum degree, in: Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), pp. 177\u2013207, Colloq. Math. Soc. J\u00e1nos Bolyai, 25, North-Holland, Amsterdam-New York, 1981."},{"key":"2318_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/qmath\/18.1.369","volume":"18","author":"A. J. W. Hilton","year":"1967","unstructured":"A. J. W. Hilton and E. C. Milner: Some intersection theorems for systems of finite sets, Quart. J. Math. Oxford, Ser. 2 18 (1967), 369\u2013384.","journal-title":"Quart. J. Math. Oxford"},{"key":"2318_CR21","unstructured":"A. J. Hoffman: On eigenvalues and colorings of graphs, in: 1970 Graph Theory and its Applications (Proc. Advanced Sem., Math. Research Center, Univ. of Wisconsin, Madison, Wis., 1969), pp. 79\u201391, Academic Press, New York (Reviewer: R. C. Read)."},{"key":"2318_CR22","unstructured":"G. Kindler and S. Safra: Noise-resistant boolean functions are juntas, submitted."},{"issue":"3","key":"2318_CR23","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N. Linial","year":"1993","unstructured":"N. Linial, Y. Mansour and N. Nisan: Constant depth circuits, Fourier transform, and learnability; J. Assoc. Comput. Mach. 40(3) (1993), 607\u2013620.","journal-title":"J. Assoc. Comput. Mach."},{"key":"2318_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz: On the Shannon capacity of a graph, IEEE Transactions on Information Theory 25 (1979), 1\u20137.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2318_CR25","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"671","volume-title":"Algebraic methods in graph theory","author":"A. Schrijver","year":"1981","unstructured":"A. Schrijver: Association schemes and the Shannon capacity: Eberlein polynomials and the Erd\u0151s-Ko-Rado theorem; in: Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), pp. 671\u2013688, Colloq. Math. Soc. J\u00e1nos Bolyai, 25, North-Holland, Amsterdam-New York, 1981."},{"issue":"2\u20133","key":"2318_CR26","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579226","volume":"4","author":"R. M. Wilson","year":"1984","unstructured":"R. M. Wilson: The exact bound in the Erd\u0151s-Ko-Rado theorem, Combinatorica 4(2\u20133) (1984), 247\u2013257.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2318-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2318-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2318-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T15:32:36Z","timestamp":1588865556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2318-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,12]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["2318"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2318-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,12]]}}}