Combinatorial enumeration

From Wikipedia, the free encyclopedia

You have new messages (last change).

Combinatorial enumeration is a subfield of enumeration that deals with the counting of objects whose symmetries do not exist or, if they exist, are combinatorial in nature. See combinatorics.

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../c/o/m/Combinatorial_enumeration.html"