Partition regularity


In combinatorics, a branch of mathematics, partition regularity is one notion of largeness for a collection of sets.
Given a set, a collection of subsets is called partition regular if every set A in the collection has the property that, no matter how A is partitioned into finitely many subsets, at least one of the subsets will also belong to the collection. That is,
for any, and any finite partition, there exists an in, such that belongs to. Ramsey theory is sometimes characterized as the study of which collections are partition regular.

Examples