Szekeres–Lindström theorem

The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.