Erdos-Ko-Rado problems for permutation groups
Abstract
In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let G ≤slant Sym() be a transitive permutation group, and S an intersecting set. Previous results show that if G is either 2-transitive or a Frobenius group, then |S|≤slant|Gω| (for some ω ∈ ). Furthermore, for some 2-transitive groups, |S|=|Gω| if and only if S is a coset of a stabilizer. In this paper, we prove that these statements are far from the truth for general transitive groups. In particular, we show that in the case of primitive groups, there is even no absolute constant c such that |S|≤slant c|Gω|. In the case G is a primitive permutation group isomorphic to PSL(2,p), we characterize the subgroups of G which are intersecting sets. We also show that if G ≤slant Sym() is a permutation group of prime power degree, then for any intersecting set S, we have |S|≤ |Gω| (for some ω ∈ ). This proves a part of a conjecture in MRS.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.