On the Weiss conjecture for finite locally primitive graphs
- 1 February 2000
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 43 (1) , 129-138
Abstract
A graph Γ is said to be locally primitive if, for each vertex α, the stabilizer in Aut Γ of α induces a primitive permutation group on the set of vertices adjacent to α. In 1978, Richard Weiss conjectured that for a finite vertex-transitive locally primitive graph Γ, the number of automorphisms fixing a given vertex is bounded above by some function of the valency of Γ. In this paper we prove that the conjecture is true for finite non-bipartite graphsprovided that it is true in the case in which Aut Γ contains a locally primitive subgroup that is almost simple.Keywords
This publication has 17 references indexed in Scilit:
- Graphs with a locally linear group of automorphismsMathematical Proceedings of the Cambridge Philosophical Society, 1995
- Permutation groups with projective unitary subconstituentsProceedings of the American Mathematical Society, 1980
- Permutation Groups with Projective Unitary SubconstituentsProceedings of the American Mathematical Society, 1980
- An application of p-factorization methods to symmetric graphsMathematical Proceedings of the Cambridge Philosophical Society, 1979
- ARC TRANSITIVITY IN GRAPHS IIIThe Quarterly Journal of Mathematics, 1976
- Doubly primitive vertex stabilisers in graphsMathematische Zeitschrift, 1974
- ARC TRANSITIVITY IN GRAPHS IIThe Quarterly Journal of Mathematics, 1974
- ARC TRANSITIVITY IN GRAPHSThe Quarterly Journal of Mathematics, 1973
- Graphs and finite permutation groupsMathematische Zeitschrift, 1967
- Vertex-transitive graphsMonatshefte für Mathematik, 1964