There are only finitely many finite distance-transitive graphs of given valency greater than two

DOI10.1007/BF02579277zbMath0507.05037MaRDI QIDQ1837204

Peter J. Cameron

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

primitive permutation groupdistance-transitive

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Distance transitive graphs with symmetric or alternating automorphism group ⋮ There are only finitely many distance-regular graphs of fixed valency greater than two ⋮ Root systems and the Johnson and Hamming graphs ⋮ A census of infinite distance-transitive graphs ⋮ Distance-regular graphs with girth 3 or 4: I

Cites Work

• Unnamed Item
• Infinite distance transitive graphs of finite valency
• Über lokal s-reguläre Graphen
• On bipartite tetra0alent graphs
• Bounds for orders of maximal subgroups
• On the Sims Conjecture and Distance Transitive Graphs
• Distance-Transitive Graphs of Valency Four
• On Trivalent Graphs
• PRIMITIVE AND IMPRIMITIVE GRAPHS
• On Tetravalent Graphs
• ARC TRANSITIVITY IN GRAPHS