2009Proceedings of the Steklov Institute of MathematicsRequires access

On the automorphism group of the Aschbacher graph

А. А. Махнев, D. V. Paduchikh

Open publisher page 1 citations

Abstract

A Moore graph is a regular graph of degree k and diameter d with v vertices such that v ≤ 1 + k + k(k − 1) + ... + k(k − 1)d−1. It is known that a Moore graph of degree k ≥ 3 has diameter 2; i.e., it is strongly regular with parameters λ = 0, µ = 1, and v = k 2 + 1, where the degree k is equal to 3, 7, or 57. It is unknown whether there exists a Moore graph of degree k = 57. Aschbacher showed that a Moore graph with k = 57 is not a graph of rank 3. In this connection, we call a Moore graph with k = 57 the Aschbacher graph and investigate its automorphism group G without additional assumptions (earlier, it was assumed that G contains an involution).

About this research paper

What this paper is about

A Moore graph is a regular graph of degree k and diameter d with v vertices such that v ≤ 1 + k + k(k − 1) + ... + k(k − 1)d−1. It is known that a Moore graph of degree k ≥ 3 has diameter 2; i.e., it is strongly regular with parameters λ = 0, µ = 1, and v = k 2 + 1, where the degree k is equal to 3, 7, or 57. It is unknown whether there exists a Moore graph of degree k = 57. Aschbacher showed that a Moore graph with k = 57 is not a graph of rank 3. In this connection, we call a Moore graph with k = 57 the Aschbacher graph and investigate its automorphism group G without additional assumptions (earlier, it was assumed that G contains an involution).

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A Moore graph is a regular graph of degree k and diameter d with v vertices such that v ≤ 1 + k + k(k − 1) + ... + k(k − 1)d−1. It is known that a Moore graph of degree k ≥ 3 has diameter 2; i.e., it is strongly regular with parameters λ = 0, µ = 1, and v = k 2 + 1, where the degree k is equal to 3, 7, or 57. It is unknown whether there exists a Moore graph of degree k = 57. Aschbacher showed that a Moore graph with k = 57 is not a graph of rank 3. In this connection, we call a Moore graph with k = 57 the Aschbacher graph and investigate its automorphism group G without additional assumptions (earlier, it was assumed that G contains an involution).

Key concepts: Combinatorics, Mathematics, Distance-regular graph, Edge-transitive graph, Graph, Vertex-transitive graph, Regular graph, Voltage graph

Related papers

Back to paper searchBrowse research topicsOriginal source
On the automorphism group of the Aschbacher graph — Research Paper | ScholarLens