On the weiss conjecture for finite locally primitive graphs

Proceedings of the Edinburgh Mathematical Society

Volumn 43, Issue 1, 2000, Pages 129-138

  Conder, Marston D ^a   Li, Cai Heng ^b   Praeger, Cheryl E ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Almost simple groups; Locally primitive graphs; Quasiprimitive permutation groups; Vertex transitive graphs

Indexed keywords

EID: 22844453429     PISSN: 00130915     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0013091500020745     Document Type: Article

References (24)

1. P. J. CAMERON, C. E. PRAEGER, J. SAXL AND G. M. SEITZ, On the Sims conjecture and distance transitive graphs, Bull. Land. Math. Soc. 15 (1983), 499-506.
2. J. D. DlXON AND B. MORTIMER, Permutation groups (Springer, New York and Berlin 1996).
3. T. GARDINER, Arc transitivity in graphs, Q. J. Math. Oxford (2) 24 (1973), 399-407.
4. T. GARDINER, Doubly primitive vertex stabilizers in graphs, Math. Z. 135 (1974), 157166.
5. T. GARDINER, Arc transitively in graphs, II, Q. J. Math. Oxford (2) 25 (1974), 163-167.
6. T. GARDINER, Arc transitively in graphs, III, Q. J. Math. Oxford (2) 27 (1976), 313-323.
7. C. D. GODSIL, On the full automorphism group of a graph, Combinatorial 1 (1981), 243-256.
8. C. E. PRAEGER, Imprimitive symmetric graphs, Ars Combin. 19A (1985), 149-163.
9. C. E. PRAEGER, An O'Nan-Scott Theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs, J. Land. Math. Soc. (2) 47 (1993), 227-239.
10. C. E. PRAEGER, On a reduction theorem for finite, bipartite, 2-arc transitive graphs, Australas. J. Combin. 7 (1993), 21-36.
11. C. E. PRAEGER, Finite quasiprimitive graphs, in Surveys in combinatorics, London Mathematical Society Lecture Note Series, vol. 24 (1997), pp. 65-85.
12. G. SABIDUSSI, Vertex-transitive graphs, Monatsh. Math. 68 (1964), 426-438.
13. C. C. SlMS, Graphs and finite permutation groups, Math. Z. 95 (1967), 76-86.
14. M. SUZUKI, Group theory, I (Springer, New York, 1982).
15. J. G. THOMPSON, Bounds for the orders of maximal subgroups, J. Algebra 14 (1970), 135-138.
16. V. I. TROFIMOV, Stabilizers of the vertices of graphs with projective suborbits, Soviet Math. Dokl 42 (1991), 825-828.
17. V. I. TROFIMOV, Graphs with projective suborbits (in Russian), Izv. Akad. Nauk SSSR Ser. Mat. 55 (1991), 890-916.
18. V. I. TROFIMOV, Graphs with projective suborbits, cases of small characteristics, I (in Russian), Izv. Akad. Nauk SSSR Ser. Mat. 58 (1994), 124-171.
19. V. I. TROFIMOV, Graphs with projective suborbits, cases of small characteristics, II (in Russian), Izv. Akad. Nauk SSSR Ser. Mat. 58 (1994), 137-156.
20. V. I. TROFIMOV AND R. WEISS, Graphs with a locally linear group of automorphisms, Math. Proc. Camb. Phil. Soc. 118 (1995), 191-206.
21. R. WEISS, s-transitive graphs, Colloq. Math. Soc. Jdnos Bolyai 25 (1978), 827-847.
22. R. WEISS, Groups with a (B, AT)-pair and locally transitive graphs, Nagoya Math. J. 74 (1979), 1-21.
23. R. WEISS, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979), 43-48.
24. R. WEISS, Permutation groups with projective unitary subconstituents, Proc. Am. Math.' Soc. 78 (1980), 157-161.