Skip to main content
Log in

Automorphisms of Aschbacher Graphs

  • Published:
Algebra and Logic Aims and scope

Abstract

If a regular graph of valence \(k\) and diameter \(d\) has \(v\) vertices, then \(v \leqslant 1{\text{ + }}k{\text{ + }}k\left( {k - 1} \right) + \cdot \cdot \cdot + k\left( {k - 1} \right)^{d - 1} \), which was proved by Moore (cf. [1]). Graphs for which this non-strict inequality turns into an equality are called Moore graphs. Such have an odd girth equal to \(2d + 1\). The simplest example of a Moore graph is furnished by a \(\left( {2d + 1} \right)\)-triangle. Damerell proved that a Moore graph of valence \(k \geqslant 3\) has diameter 2. In this case \(v = k^2 {\text{ + }}1\), the graph is strongly regular with \(\lambda = 0\) and \(\mu = 1\), and the valence \(k\) is equal to 3 (Peterson's graph), to 7 (Hoffman–Singleton's graph), or to 57. The first two graphs are of rank 3. Whether a Moore graph of valence \(k = 57\) exists is not known; yet, Aschbacher proved that the Moore graph with \(k = 57\) will not be a rank 3 graph. We call the Moore graph with \(k = 57\) the Aschbacher graph. Cameron showed that such cannot be vertex transitive. Here, we treat subgraphs of fixed points of Moore graph automorphisms and an automorphism group of the hypothetical Aschbacher graph for the case where that group contains an involution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. A. J. Hoffman and R. R. Singleton, “On Moore graphs with diameters 2 and 3,” IBM J. Res. Dev., 4, 497-504 (1960).

    Google Scholar 

  2. R. R. Singleton, “There is no irregular Moore graph,” Am. Math. Month., 75, 42-43 (1968).

    Google Scholar 

  3. R. M. Damerell, “On Moore graphs,” Math. Proc. Cambr. Phil. Soc., 74, 227-236 (1973).

    Google Scholar 

  4. M. Aschbacher, “The nonexistence of rank three permutation groups of degree 3250 and subdegree 57,” J. Alg., 19, No. 3, 538-540 (1971).

    Google Scholar 

  5. P. Cameron, Permutation Groups, London Math. Soc. Stud. Texts, Vol. 45, Cambridge Univ. Press (1999).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makhnev, A.A., Paduchikh, D.V. Automorphisms of Aschbacher Graphs. Algebra and Logic 40, 69–74 (2001). https://doi.org/10.1023/A:1010217919915

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010217919915

Keywords

Navigation