Combinatorics seminar
Speaker: Venkata Raghu Tej Pantangi
Host: Niranjan Balachandran
Title: Erd\H{o}s-Ko-Rado Combinatorics
Time, day and date: 11:45:00 AM - 12:45:00 PM, Thursday, August 21
Venue: Ramanujan Hall
Abstract: The eponymous Erdős-Ko-Rado (EKR) theorem is a central result in extremal combinatorics, which determines the size and the structure of the largest possible collections of pairwise intersecting $k$-subsets of a fixed $n$-set. This seminal result spawned a family of analogous results for a wide range of mathematical objects that possess a notion of
intersection, such as vector spaces, permutations, perfect matchings, spanning trees, and many more. In this talk, I will
(i) introduce the EKR theorem along with some of its interesting generalizations and analogues; and
(ii) give an overview of some algebraic techniques that built a unifying methodology to prove many EKR-type results.