Almost-Fisher families

Shagnik Das, Benny Sudakov, Pedro Vieira

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal{F}$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can…