Editing Enumeration (section)

== Combinatorics ==
{{main article|Enumerative combinatorics}}

In combinatorics, enumeration means [[counting]], i.e., determining the exact number of elements of finite sets, usually grouped into infinite families, such as the family of sets each consisting of all [[permutation]]s of some finite set. There are flourishing subareas in many branches of mathematics concerned with enumerating in this sense. For instance, in ''[[integer partition|partition]] enumeration'' and ''[[graph enumeration]]'' the objective is to count partitions or graphs that meet certain conditions.