Computer Science/Discrete Mathematics Seminar I
Topic: Extremal set theory
Speaker: Andrey Kupavskii
Affiliation: Member, School of Mathematics
Date & Time: Tuesday October 29th, 2019, 10:30am - 12:30pm
Location: Simonyi Hall 101
Extremal set theory typically asks for the largest collection of sets satisfying certain constraints. In the first talk of these series, I'll cover some of the classical results and methods in extremal set theory. In particular, I'll cover the recent progress in the Erdos Matching Conjecture, which suggests the largest size of a family of k-subsets of an n-element set with no s pairwise disjoint sets.