Disjoint Pairs in Set Systems and the Combinatorics of Low-Rank Matrices
Benjamin Sudakov
11:00am|Simonyi Hall 101 and Remote Access
In this talk, I will discuss the solution to several problems in
two closely related settings: set families in 2^[n] with many
disjoint pairs, and low-rank matrices with many zero entries.
Highlights include a resolution of an old question of
Daykin...