|
|||||||||||||||||||||
|
Speaker: Raghu Pantangi
Venue: Ramanujan Hall
Time: 11:30-12:30 hrs
Date: 14th Nov 2024
Title: Erd\H{o}s-Ko-Rado theorem and its generalizations.
Abstract: Erd\H{o}s-Ko-Rado (EKR) theorem is a classical result in extremal
combinatorics. This celebrated result determines the size and the structure
of the largest possible collections of pairwise intersecting $k$-subsets of a
fixed $n$-set. There have been many generalizations of this result to other
mathematical objects which possess a notion of intersection ( vector spaces,
permutations, perfect matchings, etc.). In this talk, we will discuss some of
these generalizations, with a special focus on permutation groups.