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

Peter J. Cameron

doi:10.1007/BF02579277

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

Peter J. Cameron^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation groups (which has recently been established using the classification of finite simple groups). An alternative approach to this result, using less group theory but relying on a theorem of Macpherson on infinite distance-transitive graphs, is explored.

Original language	English
Pages (from-to)	9-13
Number of pages	5
Journal	Combinatorica
Volume	2
Issue number	1
DOIs	https://doi.org/10.1007/BF02579277
Publication status	Published - 1 Mar 1982

Keywords

AMS subject classification (1980): 05C25

Access to Document

10.1007/BF02579277

Cite this

@article{87d6654c31e44f86a2c2347cb16fba23,

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

abstract = "The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation groups (which has recently been established using the classification of finite simple groups). An alternative approach to this result, using less group theory but relying on a theorem of Macpherson on infinite distance-transitive graphs, is explored.",

keywords = "AMS subject classification (1980): 05C25",

author = "Cameron, {Peter J.}",

year = "1982",

month = mar,

day = "1",

doi = "10.1007/BF02579277",

language = "English",

volume = "2",

pages = "9--13",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "1",

}

TY - JOUR

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

AU - Cameron, Peter J.

PY - 1982/3/1

Y1 - 1982/3/1

N2 - The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation groups (which has recently been established using the classification of finite simple groups). An alternative approach to this result, using less group theory but relying on a theorem of Macpherson on infinite distance-transitive graphs, is explored.

AB - The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation groups (which has recently been established using the classification of finite simple groups). An alternative approach to this result, using less group theory but relying on a theorem of Macpherson on infinite distance-transitive graphs, is explored.

KW - AMS subject classification (1980): 05C25

UR - http://www.scopus.com/inward/record.url?scp=51249180422&partnerID=8YFLogxK

U2 - 10.1007/BF02579277

DO - 10.1007/BF02579277

M3 - Article

AN - SCOPUS:51249180422

SN - 0209-9683

VL - 2

SP - 9

EP - 13

JO - Combinatorica

JF - Combinatorica

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this