Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
Abstract
The main result of this paper is that, if is a connected 4-valent G-arc-transitive graph and v is a vertex of , then either is one of a well understood infinite family of graphs, or |Gv|≤ 2436 or 2|Gv|2(|Gv|/2)≤ || and that this last bound is tight. As a corollary, we get a similar result for 3-valent vertex-transitive graphs.
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.