Abstract
We prove an analogue of the classical Erdos-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set Ω, we show that an intersecting set of maximal size in G has cardinality |G|/|Ω|. This generalises and gives a unifying proof of some similar recent results in the literature.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 100-118 |
| Number of pages | 19 |
| Journal | European Journal of Combinatorics |
| Volume | 55 |
| DOIs | |
| State | Published - Jul 1 2016 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'An Erdos-Ko-Rado theorem for finite 2-transitive groups'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS