Category:Combinatorics
From Wikipedia, the free encyclopedia
Combinatorics is a branch of mathematics that studies finite collections of objects that satisfy specified criteria, and is in particular concerned with "counting" the objects in those collections (enumerative combinatorics) and with deciding whether certain "optimal" objects exist (extremal combinatorics). One of the most prominent combinatorialists of recent times was Gian-Carlo Rota, who helped formalize the subject beginning in the 1960s. The prolific problem-solver Paul Erdős worked mainly on extremal questions. The study of how to count objects is sometimes thought of separately as the field of enumeration.
(previous 200) (next 200)
Subcategories
This category has the following 14 subcategories, out of 15 total.
CG |
ILMO |
PQRS |
Pages in category "Combinatorics"
The following 186 pages are in this category, out of 215 total. This list may sometimes be slightly out of date (learn more)
