1981
DOI: 10.1007/bf02579337
|View full text |Cite
|
Sign up to set email alerts
|

The nonexistence of 8-transitive graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
109
0
1

Year Published

1995
1995
2016
2016

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 154 publications
(110 citation statements)
references
References 14 publications
0
109
0
1
Order By: Relevance
“…Tutte's Theorem was generalized by Weiss [24] who proved that there exist no finite stransitive graphs of valency at least 3 for s = 6 and s ≥ 8. Since then, characterizing s-arc transitive graphs has received considerable attention in the literature (see, for example, [11,14,19,24]). …”
Section: Introductionmentioning
confidence: 99%
“…Tutte's Theorem was generalized by Weiss [24] who proved that there exist no finite stransitive graphs of valency at least 3 for s = 6 and s ≥ 8. Since then, characterizing s-arc transitive graphs has received considerable attention in the literature (see, for example, [11,14,19,24]). …”
Section: Introductionmentioning
confidence: 99%
“…This situation is quite different from that of finite undirected regular graphs of degree greater than 2, which by a theorem of Richard Weiss [7] can be at most 7-arc-transitive.…”
Section: Introductionmentioning
confidence: 76%
“…Also a~lx t a = x i+ i for 1 < / < s whereas none of the conjugates of the non-trivial powers terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/S1446788700038477 [7] Constructions for arc-transitive digraphs 67 of x s+1 by the permutation a lie in H (because they all move the point (s + l)k + 1), therefore H n a' 1 Ha is the subgroup generated by all the Xj other than x u implying that this digraph A = A(G, H, a) is ^-regular. The intersection of all the conjugates of H in G is trivial, so G acts faithfully on A.…”
Section: Examplementioning
confidence: 99%
“…These three classes of graphs are important because of the following result (see [10] and [33,35], also refer to [13, Theorem 2.1.5]).…”
Section: Amalgams Of S-transitive Graphs For S ∈ {4 5 7}mentioning
confidence: 99%