{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:07:42Z","timestamp":1761862062697},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":5403,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0012-365x(98)00063-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"11-26","source":"Crossref","is-referenced-by-count":8,"title":["A census of infinite distance-transitive graphs"],"prefix":"10.1016","volume":"192","author":[{"given":"Peter J.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00063-6_BIB1","series-title":"Distance-Regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01214702","article-title":"Transitivity of permutation groups on unordered sets","volume":"48","author":"Cameron","year":"1976","journal-title":"Math. Z."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0095-8956(80)90063-5","article-title":"6-transitive graphs","volume":"28","author":"Cameron","year":"1980","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02579277","article-title":"There are only finitely many distance-transitive graphs of given valency greater than 2","volume":"2","author":"Cameron","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB5","article-title":"Oligomorphic Permutation Groups","volume":"vol. 152","author":"Cameron","year":"1990"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(91)90424-Z","article-title":"Covers of graphs and EGQs","volume":"97","author":"Cameron","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0012-365X(92)00468-7","article-title":"Two-graphs and trees","volume":"127","author":"Cameron","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB8","series-title":"Finite and Infinite Combinatorics in Sets and Logic","first-page":"81","article-title":"Homogeneous directed graphs","author":"Cherlin","year":"1993"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB9","first-page":"1","article-title":"A universal structure for N-free graphs","volume":"58","author":"Covington","year":"1989"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/jctb.1994.1055","article-title":"Set-homogeneous graphs","volume":"62","author":"Droste","year":"1994","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(91)90018-C","article-title":"On k-homogeneous posets and graphs","volume":"56","author":"Droste","year":"1991","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB12","first-page":"540","article-title":"Sur certains relations qui g\u00e9n\u00e9ralisent l'ordre des nombres rationnels","volume":"237","author":"Fra\u00efss\u00e9","year":"1953","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB13","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(76)90072-1","article-title":"Homogeneous graphs","volume":"20","author":"Gardiner","year":"1976","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Can. J. Math."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.2140\/pjm.1971.38.69","article-title":"A family of countable homogeneous graphs","volume":"38","author":"Henson","year":"1971","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0168-0072(93)90171-9","article-title":"A new strongly minimal set","volume":"62","author":"Hrushovski","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00181482","article-title":"Amalgams and embeddings of projective planes","volume":"2","author":"Kegel","year":"1973","journal-title":"Geometriae Dedicata"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/BF02787220","article-title":"Some universal graphs","volume":"64","author":"Komjath","year":"1988","journal-title":"Israel J. Math."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB19","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1090\/S0002-9947-1984-0743728-1","article-title":"Countable homogeneous tournaments","volume":"284","author":"Lachlan","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/S0002-9947-1980-0583847-2","article-title":"Countable ultrahomogeneous undirected graphs","volume":"262","author":"Lachlan","year":"1980","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(98)00063-6_BIB21","first-page":"477","article-title":"The affine permutation groups of rank 3","volume":"54","author":"Liebeck","year":"1987"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF02579282","article-title":"Infinite distance-transitive graphs of finite valency","volume":"2","author":"Macpherson","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB23","series-title":"Finite and Infinite Combinatorics in Sets and Logic","first-page":"279","article-title":"Homogeneous partially ordered sets","author":"Mekler","year":"1993"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB24","series-title":"Proc. Internat. Coll. Teorie Combinatorie","first-page":"481","article-title":"A survey of two-graphs","author":"Seidel","year":"1977"},{"issue":"2","key":"10.1016\/S0012-365X(98)00063-6_BIB25","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1093\/qmath\/22.4.551","article-title":"Primitive and imprimitive graphs","volume":"22","author":"Smith","year":"1971","journal-title":"Quart. J. Math. Oxford"},{"issue":"A","key":"10.1016\/S0012-365X(98)00063-6_BIB26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0097-3165(92)90056-Z","article-title":"2-graphs and doubly transitive groups","volume":"61","author":"Taylor","year":"1992","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB27","doi-asserted-by":"crossref","first-page":"176","DOI":"10.2307\/2274912","article-title":"Reducts of the random graph","volume":"56","author":"Thomas","year":"1991","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB28","series-title":"Automorphisms of First-Order Structures","first-page":"153","article-title":"Relational structures and dimensions","author":"Wagner","year":"1995"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB29","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02579337","article-title":"The non-existence of 8-transitive graphs","volume":"1","author":"Weiss","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(98)00063-6_BIB30","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1112\/blms\/17.3.253","article-title":"On distance-transitive graphs","volume":"17","author":"Weiss","year":"1985","journal-title":"Bull. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:54:37Z","timestamp":1556132077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98000636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0012365X98000636"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00063-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}