Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs

preprint2010arXivOpen access

Abstract

The main result of this paper is that, if ΓΓ is a connected 4-valent GG-arc-transitive graph and vv is a vertex of ΓΓ, then either ΓΓ is one of a well understood infinite family of graphs, or ∣Gv∣≤2436|G_v|\leq 2^43^6 or $2|G_v|\log_2(|G_v|/2)\leq |\VΓ|$ and that this last bound is tight. As a corollary, we get a similar result for 33-valent vertex-transitive graphs.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.