Combinatorial structures such as set systems, hypergraphs and families of finite objects form a unifying framework for extremal problems that probe how local intersection constraints govern global ...

The Erdős–Ko–Rado (EKR) theorem is a cornerstone of extremal set theory, originally characterising the maximum size of a family of k-element subsets of an n-element set in which every pair of subsets ...