Abstract
It is known that there are precisely three transitive permutation groups of degree that admit an invariant partition with three parts of size such that the kernel of the action on the parts has order ; these groups are called , and . For each , we construct an infinite family of finite connected -valent graphs and arc-transitive groups such that the permutation group induced by the action of the vertex-stabiliser on the neighbourhood of a vertex is permutation isomorphic to , and such that is exponential in . These three groups were the only transitive permutation groups of degree at most for which the existence of such a family was undecided. In the process, we construct an infinite family of cubic -arc-transitive graphs such that the dimension of the -eigenspace over the field of order of the adjacency matrix of the graph grows linearly with the order of the graph.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.