{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T04:16:57Z","timestamp":1773289017068,"version":"3.50.1"},"reference-count":9,"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\/bf02579226","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:15:56Z","timestamp":1174598156000},"page":"247-257","source":"Crossref","is-referenced-by-count":201,"title":["The exact bound in the Erd\u00f6s-Ko-Rado theorem"],"prefix":"10.1007","volume":"4","author":[{"given":"Richard M.","family":"Wilson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579226_CR1","unstructured":"P. Delsarte, An algebraic approach to the association schemes of coding theory,Philips Res. Reports Suppl. 10 (1973)."},{"issue":"2","key":"BF02579226_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P. Erd\u00f6s","year":"1961","unstructured":"P. Erd\u00f6s, C. 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"},{"key":"BF02579226_CR3","first-page":"365","volume-title":"The Erd\u00f6s-Ko-Rado theorem is true forn=ckt","author":"P. Frankl","year":"1978","unstructured":"P. Frankl, The Erd\u00f6s-Ko-Rado theorem is true forn=ckt, in:Combinatorics, Proc. Fifth Hungarian Coll. Combinatorics, Keszthely, 1976, North-Holland, Amsterdam, 1978, 365\u2013375."},{"key":"BF02579226_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0097-3165(73)90037-X","volume":"15","author":"J. E. Graver","year":"1973","unstructured":"J. E. Graver andW. B. Jurkat, The module structure of integral designs,J. Combinat. Th. (A) 15 (1973), 75\u201390.","journal-title":"J. Combinat. Th. (A)"},{"key":"BF02579226_CR5","volume-title":"Packing and Covering in Combinatories","author":"W. Haemers","year":"1979","unstructured":"W. Haemers, Eigenvalue methods, in:Packing and Covering in Combinatories (A. Schrijver, ed.). Tract106, Mathematical Centre, Amsterdam 1979."},{"key":"BF02579226_CR6","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 Trans. Inform. Theory 25 (1979), 1\u20137.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF02579226_CR7","volume-title":"The theory of error-correcting codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams andN. J. A. Sloane,The theory of error-correcting codes, North-Holland, Amsterdam, 1977."},{"key":"BF02579226_CR8","unstructured":"A. Schrijver, Association schemes and the Shannon capacity: Eberlein polynomials and the Erd\u00f6s-Ko-Rado Theorem,in: Algebraic Methods in Graph Theory, Proc. Sixth Hungarian Coll. Combinatorics, Szeged, 1978, Colloquia Mathematica Societatis J\u00e1nos Bolyai, 671\u2013688."},{"key":"BF02579226_CR9","first-page":"207","volume":"4","author":"R. M. Wilson","year":"1973","unstructured":"R. M. Wilson, The necessary conditions fort-designs are sufficient for something,Utilitas Mathematica 4 (1973), 207\u2013215.","journal-title":"Utilitas Mathematica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579226.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579226\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579226","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\/BF02579226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":9,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["BF02579226"],"URL":"https:\/\/doi.org\/10.1007\/bf02579226","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}