Maximum Size $t$-Intersecting Families and Anticodes

Xuan Wang, Tuvi Etzion, Denis Krotov +1

The maximum size of $t$-intersecting families is one of the most celebrated topics in combinatorics, and its size is known as the Erdős-Ko-Rado theorem. Such intersecting families…