(mathematics) A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors.

(set theory) A theorem that describes the largest possible families of finite sets none of which contain any other sets in the family.