Enumerative combinatorics is concerned with counting the number of combinatorial objects such as permutations, combinations, multisets, partitions of sets, partitions of numbers, and the like. The counting techniques are simple but are often applied in a skillful way to great effect. The very large number of applications of enumerative combinatorics in computer science led to a resurgence of the field.