Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, May 07, 2020, 12:15 pm
Duration: 45 minutes
Location: Zoom: conference room
Speaker: Miklós Horváth
A family of p sets whose pairwise intersections are the same is called a p-sunflower. This talk is about finding the minimum f(p,k) such that any family of f(p,k) sets of cardinality k is guaranteed to contain a p-sunflower.
Erdős and Rado introduced this problem in 1960 and proved first bounds on f(p,k). In a recent breakthrough, Alweiss, Lovett, Wu and Zhang showed a significantly improved upper bound on f(p,k). Afterwards, Rao proved a similar upper bound with a cleaner proof , which is outlined in this talk.
 A. Rao, Coding for Sunflowers, Discrete Analysis, 2020
Automatic MiSe System Software Version 1.4803M | admin login