Three local actions in 6-valent arc-transitive graphs

Abstract

It is known that there are precisely three transitive permutation groups of degree 6 that admit an invariant partition with three parts of size 2 such that the kernel of the action on the parts has order 4; these groups are called A4(6), S4(6d) and S4(6c). For each L∈ \A4(6), S4(6d), S4(6c)\, we construct an infinite family of finite connected 6-valent graphs \n\n∈ N and arc-transitive groups Gn Aut(n) such that the permutation group induced by the action of the vertex-stabiliser (Gn)v on the neighbourhood of a vertex v is permutation isomorphic to L, and such that |(Gn)v| is exponential in |V(n)|. These three groups were the only transitive permutation groups of degree at most 7 for which the existence of such a family was undecided. In the process, we construct an infinite family of cubic 2-arc-transitive graphs such that the dimension of the 1-eigenspace over the field of order 2 of the adjacency matrix of the graph grows linearly with the order of the graph.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…