Andrey Kupavskii: Concentration inequalities for matchings

Abstract: In this talk, I will discuss several questions related to the Erdos Matching Conjecture and in particular the progress that we obtained using a certain concentration result for intersections of a set family and a random matching. The concrete problems will include the Erdos Matching Conjecture, its rainbow version, as well as the rainbow version of the EMC for multipartite families (i.e., families in [n]^k). Based on joint works with Peter Frankl and Sergei Kiselev.

https://zoom.us/j/91399666052?pwd=VCtmb0U0RVI5ckE4eXNHQkV0c1l0QT09

If needed, the passcode is 222823.