An Erdős-Ko-Rado theorem for finite \(2\)-transitive groups
| dc.contributor.author | Meagher, Karen | |
| dc.contributor.author | Spiga, Pablo | |
| dc.contributor.author | Tiep, Pham Huu | |
| dc.date.accessioned | 2018-04-18T01:58:05Z | |
| dc.date.available | 2018-04-18T01:58:05Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | We prove an analogue of the classical Erdős-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 \(\Omega\), we show that an intersecting set of maximal size in \(G\) has cardinality \(|G|/|\Omega|\). This generalises and gives a unifying proof of some similar recent results in the literature. | en_US |
| dc.description.authorstatus | Faculty | en_US |
| dc.description.peerreview | yes | en_US |
| dc.description.sponsorship | The first author is supported by NSERC. The third author was partially supported by the NSF grant DMS-1201374 and the Simons Foundation Fellowship 305247. | en_US |
| dc.identifier.issn | 0195-6698 | |
| dc.identifier.uri | https://hdl.handle.net/10294/8288 | |
| dc.language.iso | en | en_US |
| dc.publisher | European Journal of Combinatorics | en_US |
| dc.subject | derangement graph, independent sets, Erd\H{o}s-Ko-Rado theorem | en_US |
| dc.title | An Erdős-Ko-Rado theorem for finite \(2\)-transitive groups | en_US |
| dc.type | Article | en_US |