2022-03-21
10:00 — 11:00
FAMNIT-MP1
Ademir Hujdurović (UP FAMNIT, Slovenia)
Erdős-Ko-Rado type theorems 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. Given a permutation group G acting on a set V, a subset S of G is called intersecting if any two permutations in S coincide on at least one point.
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.
Based on joint work with Istvan Kovacs, Klavdija Kutnar, Bojan Kuzma, Dragan Marušič, Štefko Miklavič and Marko Orel.
Our Math Research Seminar will not be broadcasted via Zoom this time.
Everyone is welcome and encouraged to attend.