{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:50:29Z","timestamp":1781196629453,"version":"3.54.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0195-6698(03)00078-7","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T09:47:57Z","timestamp":1057571277000},"page":"881-890","source":"Crossref","is-referenced-by-count":110,"title":["Intersecting families of permutations"],"prefix":"10.1016","volume":"24","author":[{"given":"Peter J.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.Y.","family":"Ku","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(03)00078-7_B1","series-title":"Combinatorics of Finite Sets","author":"Anderson","year":"1987"},{"key":"10.1016\/S0195-6698(03)00078-7_B2","series-title":"Algebraic, Extremal and Metric Combinatorics 1986","first-page":"39","article-title":"Metric and geometric properties of sets of permutations","author":"Cameron","year":"1986"},{"key":"10.1016\/S0195-6698(03)00078-7_B3","first-page":"205","article-title":"Permutations","volume":"vol. II","author":"Cameron","year":"2002"},{"issue":"22","key":"10.1016\/S0195-6698(03)00078-7_B4","first-page":"352","article-title":"On the maximum number of permutations with given maximal or minimal distance","volume":"A","author":"Deza","year":"1977","journal-title":"J.\u00a0Combin. Theory Ser."},{"issue":"12","key":"10.1016\/S0195-6698(03)00078-7_B5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","article-title":"Intersection theorems for systems of finite sets","volume":"2","author":"Erd\u0151s","year":"1961","journal-title":"Quart. J. Math."},{"key":"10.1016\/S0195-6698(03)00078-7_B6","unstructured":"The GAP Group (2002). GAP\u2014Groups, Algorithms, and Programming, Aachen, St Andrews. Available from: http:\/\/www-gap.dcs.st-and.ac.uk\/~gap"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803000787?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669803000787?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T03:59:41Z","timestamp":1552881581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669803000787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":6,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0195669803000787"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(03)00078-7","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}