Jump to content

Combinatorial enumeration

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Escarbot (talk | contribs) at 21:13, 18 February 2008 (robot Adding: ru:Перечисление (комбинаторика)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 also

Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Combinatorial_enumeration&oldid=192394839"