Enumerative combinatorics is the branch of combinatorics concerned with counting finite sets of objects satisfying prescribed conditions. A counting problem may be answered by a closed form, a recurrence relation, a generating function, or an asymptotic estimate (Stanley 2012, pp. 1-3).
Enumerative Combinatorics
See also
Combinatorics, Enumeration Problem, Generating FunctionExplore with Wolfram|Alpha
References
Stanley, R. P. Enumerative Combinatorics, Vol. 1, 2nd ed. Cambridge, England: Cambridge University Press, 2012. https://doi.org/10.1017/CBO9781139058520.Cite this as:
Weisstein, Eric W. "Enumerative Combinatorics." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EnumerativeCombinatorics.html