The branch of mathematics which studies arrangements of elements (usually a finite number) into sets under certain prescribed constraints. Problems combinatorialists attempt to solve include the enumeration problem (how many such arrangements are there?), the structure problem (what are the properties of these arrangements and how efficiently can associated calculations be made?), and, when the constraints become more subtle, the existence problem (is there such an arrangement?).