2009
DOI: 10.1134/s0081543809070141
|View full text |Cite
|
Sign up to set email alerts
|

On the automorphism group of the Aschbacher graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…On the other hand, a coclique orbit outside the neighborhood of a fixed vertex is connected by thick edges with at most 9 orbits of type (1), and a coclique orbit in the neighborhood of a fixed vertex is connected by thick edges with at most 6 orbits of type (1); this contradicts the fact that the number of thick edges between orbits of type (1) and coclique orbits does not exceed 3 · 6 + 2 · 9 = 36. Suppose there are δ coclique orbits that contain vertices adjacent to triples of vertices in orbits of type (1). None of these δ orbits can contain a vertex adjacent to triples of vertices in different orbits of type (1).…”
Section: Lemma 23 If P > 3 Then Eithermentioning
confidence: 99%
See 3 more Smart Citations
“…On the other hand, a coclique orbit outside the neighborhood of a fixed vertex is connected by thick edges with at most 9 orbits of type (1), and a coclique orbit in the neighborhood of a fixed vertex is connected by thick edges with at most 6 orbits of type (1); this contradicts the fact that the number of thick edges between orbits of type (1) and coclique orbits does not exceed 3 · 6 + 2 · 9 = 36. Suppose there are δ coclique orbits that contain vertices adjacent to triples of vertices in orbits of type (1). None of these δ orbits can contain a vertex adjacent to triples of vertices in different orbits of type (1).…”
Section: Lemma 23 If P > 3 Then Eithermentioning
confidence: 99%
“…Let X i be the set of vertices in Γ − Ω that are adjacent to precisely i vertices in Ω, x i = |X i |. (1) x 0 = α 1 (t), 3|Ω| − x 0 is divisible by 9, and if u ∈ X 3 and {b 1 Proof. Let p = 2.…”
Section: Lemma 24 If P = 3 Then ω Is a Subgraph As In The Conclusimentioning
confidence: 99%
See 2 more Smart Citations