Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, October 23, 2025, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Aleksa Milojevic

Set-families with many disjoint pairs, and their relations to coding theory and communication complexity

Given a ground set with $n$ elements, how large can a set family $F$ be if a constant fraction of pairs $(A, B)\in F\times F$ are disjoint? I will discuss several variants of this old problem, their unexpected connections to communication complexity and coding theory, and, time permitting, a simple probabilistic argument which can be used to resolve a variant of this problem. This talk is based on joint work with Zach Hunter, Benny Sudakov and Istvan Tomon.

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

Previous talks by year:   2025  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