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

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

2010-10-13

arxiv.org/abs/1010.2546v1

Mathematics

Combinatorics

37 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226066