Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

2016_06_30_naslund_sawin: Naslund and Sawin (2017) prove by the polynomial method that a family of subsets of [n] with no three sets of pairwise equal intersection has at most 3(n+1) sum_{i<=n/3} C(n,i) members, so m(n,3) <= (3/2^{2/3})^{(1+o(1))n}.