{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T03:04:46Z","timestamp":1705028686107},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,5,1]],"date-time":"1976-05-01T00:00:00Z","timestamp":199756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1976,5]]},"DOI":"10.1016\/0097-3165(76)90025-x","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T23:49:18Z","timestamp":1107992958000},"page":"306-318","source":"Crossref","is-referenced-by-count":14,"title":["Matrices dont deux lignes quelconque co\u00efncident dans un nombre donne de positions communes"],"prefix":"10.1016","volume":"20","author":[{"given":"M","family":"Deza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(76)90025-X_BIB1","series-title":"Combinatorics","first-page":"351","article-title":"Le probl\u00e8me","author":"Bolton","year":"1972"},{"key":"10.1016\/0097-3165(76)90025-X_BIB2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01894781","article-title":"On finite \u0394-systems of Erd\u00f6s and Rado","volume":"21","author":"Chv\u00e1tal","year":"1970","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0097-3165(76)90025-X_BIB3","series-title":"Expos\u00e9s de la 2\u00b0 conf\u00e9rence sovi\u00e9tique sur la th\u00e9orie du codage et ses applications","first-page":"75","article-title":"Maximalni\u00e9 ekvidistantni\u00e9 cody bolcho\u00ef dliny","author":"Deza","year":"1966"},{"key":"10.1016\/0097-3165(76)90025-X_BIB4","series-title":"Expos\u00e9s de la 4\u00b0 conf\u00e9rence sovi\u00e9tique sur la th\u00e9orie du codage et de la transmission de l'information","first-page":"77","article-title":"Line\u00efny\u00e9 m\u00e9tritcheski\u00e9 svo\u00efstva dvo\u00efitchnykh kodov","author":"Deza","year":"1969"},{"key":"10.1016\/0097-3165(76)90025-X_BIB5","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(73)90065-4","article-title":"Une propri\u00e9t\u00e9 extr\u00e9male des plans projectifs finis dans une classe de codes \u00e9quidistants","volume":"6","author":"Deza","year":"1973","journal-title":"Discrete Math."},{"issue":"No. 2","key":"10.1016\/0097-3165(76)90025-X_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(74)90059-8","article-title":"Solution d'un probl\u00e8me de Erd\u00f6s-Lovasz","volume":"16","author":"Deza","year":"1974","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/0097-3165(76)90025-X_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(74)90140-X","article-title":"Extremal problems among subsets of a set","volume":"8","author":"Erd\u00f6s","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(76)90025-X_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","article-title":"Intersection theorems for systems of sets","volume":"35","author":"Erd\u00f6s","year":"1960","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0097-3165(76)90025-X_BIB9","series-title":"Proc. third S-E conf. combinatorics, graph theory and computing","first-page":"345","article-title":"Asymptotic Behaviour of (r, \u03bb)-systems","author":"Mullin","year":"1972"},{"key":"10.1016\/0097-3165(76)90025-X_BIB10","first-page":"139","article-title":"An asymptotic property of (r, \u03bb)-systems","volume":"3","author":"Mullin","year":"1973","journal-title":"Utilitas Math."},{"key":"10.1016\/0097-3165(76)90025-X_BIB11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0012-365X(73)90066-6","article-title":"A theorem on equidistant codes","volume":"9","author":"van Lint","year":"1973","journal-title":"Discrete Math."},{"issue":"129","key":"10.1016\/0097-3165(76)90025-X_BIB12","first-page":"91","article-title":"O n\u00e9kotorykh maximalnykh podgruppakh simmetritcheskikh i znakoperemennykh grupp","volume":"87","author":"Kaloujnine","year":"1972","journal-title":"Math. USSR Sb."},{"key":"10.1016\/0097-3165(76)90025-X_BIB13","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1214\/aoms\/1177699279","article-title":"Inductive methods for BIBD","volume":"37","author":"Stanton","year":"1966","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0097-3165(76)90025-X_BIB14","unstructured":"S. A. Vanstone, A bound for \u03bd0(r, \u03bb), in \u201cProc. 5th S-E Conf. Combinatorics, Graph Theory and Computing\u201d, 661\u2013673."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731657690025X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731657690025X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T04:21:52Z","timestamp":1548735712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731657690025X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976,5]]}},"alternative-id":["009731657690025X"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(76)90025-x","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1976,5]]}}}