Affine distance-transitive graphs: The cross characteristic case (Q1304431): Difference between revisions
From MaRDI portal
Removed claims |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/eujc.1999.0286 / rank | |||
Property / author | |||
Property / author: Arjeh M. Cohen / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Sergey V. Shpectorov / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: P. G. Boyvalenkov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/eujc.1999.0286 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1969408268 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/EUJC.1999.0286 / rank | |||
Normal rank |
Latest revision as of 17:47, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Affine distance-transitive graphs: The cross characteristic case |
scientific article |
Statements
Affine distance-transitive graphs: The cross characteristic case (English)
0 references
11 May 2000
0 references
The classification of the affine distance-transitive graphs is completed in one of the few remaining cases, the so-called cross characteristic case. The first step in the proof, by bounding from above and from below the size of the graph, leaves only finitely many situations to be considered. Then the authors deal with the remaining cases by various methods to complete the classification.
0 references
distance-transitive graphs
0 references
cross characteristic condition
0 references