A census of infinite distance-transitive graphs

Discrete Mathematics

Volumn 192, Issue 1-3, 1998, Pages 11-26

  Cameron, Peter J ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043139175     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00063-6     Document Type: Article

References (31)

1. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer, Berlin, 1989.
2. P.J. Cameron, Transitivity of permutation groups on unordered sets, Math. Z. 48 (1976) 127-139.
3. P.J. Cameron, 6-transitive graphs, J. Combin. Theory B 28 (1980) 168-179.
4. P.J. Cameron, There are only finitely many distance-transitive graphs of given valency greater than 2, Combinatorica 2 (1982) 9-13.
5. P.J. Cameron, Oligomorphic Permutation Groups, London Math. Soc. Lecture Notes, vol. 152, Cambridge University Press, Cambridge, 1990.
6. P.J. Cameron, Covers of graphs and EGQs, Discrete Math. 97 (1991) 83-92.
7. P.J. Cameron, Two-graphs and trees, Discrete Math. 127 (1994) 63-74.
8. G.L. Cherlin, Homogeneous directed graphs, in: N.W. Sauer, R.E. Woodrow, B. Sands (Eds.), Finite and Infinite Combinatorics in Sets and Logic, Kluwer, Dordrecht, 1993, pp. 81-95.
9. J. Covington, A universal structure for N-free graphs, Proc. London Math. Soc. 58 (3) (1989) 1-16.
10. M. Droste, M. Giraudet, H.D. Macpherson, N. Sauer, Set-homogeneous graphs, J. Combin. Theory B 62 (1994) 63-95.
11. M. Droste, H.D. Macpherson, On k-homogeneous posets and graphs, J. Combin. Theory A 56 (1991) 1-15.
12. R. Fraïssé, Sur certains relations qui généralisent l'ordre des nombres rationnels, C.R. Acad. Sci. Paris 237 (1953) 540-542.
13. A.D. Gardiner, Homogeneous graphs, J. Combin. Theory B 20 (1976) 94-102.
14. P.C. Gilmore, A.J. Hoffman, A characterization of comparability graphs and interval graphs, Can. J. Math. 16 (1964) 539-548.
15. C.W. Henson, A family of countable homogeneous graphs, Pacific J. Math. 38 (1971) 69-83.
16. E. Hrushovski, A new strongly minimal set, Ann. Pure Appl. Logic 62 (1993) 147-166.
17. O.H. Kegel, A. Schleiermacher, Amalgams and embeddings of projective planes, Geometriae Dedicata 2 (1973) 379-395.
18. P. Komjath, A.H. Mekler J. Pach, Some universal graphs, Israel J. Math. 64 (1988) 158-168.
19. A.H. Lachlan, Countable homogeneous tournaments, Trans. Amer. Math. Soc. 284 (1984) 431-461.
20. A.H. Lachlan, R.E. Woodrow, Countable ultrahomogeneous undirected graphs, Trans. Amer. Math. Soc. 262 (1980) 51-94.
21. M.W. Liebeck, The affine permutation groups of rank 3, Proc. London Math. Soc. 54 (3) (1987) 477-516.
22. H.D. Macpherson, Infinite distance-transitive graphs of finite valency, Combinatorica 2 (1982) 63-69.
23. A.H. Mekler, Homogeneous partially ordered sets, in: N.W. Sauer, R.E. Woodrow, B. Sands (Eds.), Finite and Infinite Combinatorics in Sets and Logic, Kluwer, Dordrecht, 1993, pp. 279-288.
24. J.J. Seidel, A survey of two-graphs, Proc. Internat. Coll. Teorie Combinatorie, Roma 1973, Accad. Naz. Lincei, Roma, 1977, pp. 481-511.
25. J.J. Seidel, A survey of two-graphs, Proc. Internat. Coll. Teorie Combinatorie, Roma 1973, Accad. Naz. Lincei, Roma, 1977, pp. 481-511.
26. D.H. Smith, Primitive and imprimitive graphs, Quart. J. Math. Oxford 22 (2) (1971) 551-557.
27. D.E. Taylor, 2-graphs and doubly transitive groups, J. Combin. Theory 61 (A) (1992) 113-122.
28. S.R. Thomas, Reducts of the random graph, J. Symbolic Logic 56 (1991) 176-181.
29. P.O. Wagner, Relational structures and dimensions, in: R. Kaye, H.D. Macpherson (Eds.), Automorphisms of First-Order Structures, Oxford University Press, Oxford, 1995, pp. 153-180.
30. R.M. Weiss, The non-existence of 8-transitive graphs, Combinatorica 1 (1981) 309-311.
31. R.M. Weiss, On distance-transitive graphs, Bull. London Math. Soc. 17 (1985) 253-256.