A weak version of the Erdos-Ko-Rado theorem for 2-transitive groups.

Minisymposium: APPLICATIONS OF GROUPS IN GRAPH THEORY

Content: The celebrated Erdos-Ko-Rado theorem determines the cardinality and also describes the structure of a set of maximal size of intersecting k-subsets from a set of size n. Analogous results hold for many other combinatorial objects and in this talk we are concerned with a weak extension of the Erdos-Ko-Rado theorem to permutation groups.

Back to all abstracts