Category:Combinatorics
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 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.
Subcategories
This category has the following 8 subcategories, out of 31 total.
(previous page) (next page)Pages in category "Combinatorics"
The following 49 pages are in this category, out of 188 total. This list may not reflect recent changes.
(previous page) (next page)R
S
- Semilinear set
- Sequential dynamical system
- Seriation (statistics)
- Series multisection
- Set packing
- Sharp-SAT
- Shortest common supersequence
- Shuffle algebra
- Sicherman dice
- Sidon sequence
- Sim (game)
- Singmaster's conjecture
- Sparse ruler
- Sperner's lemma
- Spt function
- Stable marriage problem
- Stable roommates problem
- Star of David theorem
- Star product
- Stars and bars (combinatorics)
- Stirling permutation
- Sunflower (mathematics)
- Symbolic method (combinatorics)
- Symmetric function