Computer Science/Discrete Mathematics Seminar I | |

Topic: | Extremal set theory |

Speaker: | Andrey Kupavskii |

Affiliation: | Member, School of Mathematics |

Date: | Tuesday, October 29 |

Time/Room: | 10:30am - 12:30pm/Simonyi Hall 101 |

Video Link: | https://video.ias.edu/csdm/2019/1029-AndreyKupavskii |

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.