Naučno-popularno predavanje: Erdős-Ko-Rado theorem and its analogues for permutation groups

The Erdős-Ko-Rado theorem is one of the central results in extremal combinatorics. It gives a bound on the size of a family of intersecting k-subsets of a set and classifies the families satisfying the bound. In this presentation I will talk about the extension of the Erdős-Ko-Rado theorem to permutation groups. I will present some known and some new results on the maximum sizes of intersecting sets in certain permutation groups, and present several open problems.

Predavanje će se održati u srijedu 27.04.2022 od 13:oo u učionici 205.