2015
DOI: 10.1007/s00026-015-0285-6
|View full text |Cite
|
Sign up to set email alerts
|

The Erdős-Ko-Rado Property for Some 2-Transitive Groups

Abstract: A subset S of a group G ≤ Sym(n) is intersecting if for any pair of permutations π, σ ∈ S there is an i ∈ {1, 2, . . . , n} such that π(i) = σ (i). It has been shown, using an algebraic approach, that the largest intersecting sets in each of Sym(n), Alt(n), and PGL(2, q) are exactly the cosets of the point-stabilizers. In this paper, we show how this approach can be applied more generally to many 2-transitive groups. We then apply this method to the Mathieu groups and to all 2-transitive groups with degree no … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
57
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 23 publications
(57 citation statements)
references
References 17 publications
0
57
0
Order By: Relevance
“…It is shown in [17] that the Suzuki groups, Ree Groups, Higman-Sims, Symplectic groups also have the EKR-module property. The result in this paper shows that every minimal almost-simple 2-transitive groups (except possibly PSU (3,5)) has the EKR-module property. Thus we conclude with the following conjecture.…”
Section: Further Workmentioning
confidence: 68%
See 4 more Smart Citations
“…It is shown in [17] that the Suzuki groups, Ree Groups, Higman-Sims, Symplectic groups also have the EKR-module property. The result in this paper shows that every minimal almost-simple 2-transitive groups (except possibly PSU (3,5)) has the EKR-module property. Thus we conclude with the following conjecture.…”
Section: Further Workmentioning
confidence: 68%
“…It is noted in [2] that for any 2-transitive group, the character χ(g) = fix(g) − 1 is an irreducible character (throughout this section we will use χ to denote this character). Then, for any group with a 2-transitive action on a set of size n that has exactly D derangements, the eigenvalue of the derangement graph corresponding to this irreducible character is −|D|/(n − 1) (see [2] for details).…”
Section: An Algebraic Proof Of Ekr Theoremsmentioning
confidence: 99%
See 3 more Smart Citations