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: Tuesday, April 01, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Shagnik Das

Supersaturation for Intersecting Families

A family of sets is said to be intersecting if it does not contain a pair of disjoint sets. The study of intersecting families is fundamental to extremal set theory, and the celebrated theorem of Erdős-Ko-Rado bounds the size of k-uniform intersecting families over [n].

A natural question to ask, an extension known as supersaturation, is how many disjoint pairs must appear in larger families. The study of supersaturation in this setting dates back to the late seventies, having attracted the attention of Ahlswede, Frankl, Katona and others. More recently, Katona, Katona and Katona introduced a probabilistic version of the supersaturation problem.

In this talk we shall present some recent results for both deterministic and probabilistic supersaturation, which provide partial solutions to conjectures of Bollobás-Leader and Kleitman-West.

This is joint work with Wenying Gan and Benny Sudakov.

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