Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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

On Improvements of the Sunflower Lemma

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 [1], which is outlined in this talk.

[1] A. Rao, Coding for Sunflowers, Discrete Analysis, 2020

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login