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 31 subcategories, out of 31 total.
- Theorems in combinatorics (28 P)
A
- Algebraic combinatorics (48 P)
C
- Combinatorial chemistry (9 P)
- Combinatorics journals (19 P)
D
- Discrepancy theory (5 P)
E
F
G
I
M
P
- Percolation theory (13 P)
- Polyhedral combinatorics (24 P)
Q
- Q-analogs (59 P)
R
S
- Sieve theory (15 P)
- Sparse matrices (19 P)
T
- Triangles of numbers (29 P)
W
Σ
Pages in category "Combinatorics"
The following 190 pages are in this category, out of 190 total. This list may not reflect recent changes.
*
A
B
C
- Cameron–Erdős conjecture
- Catalan's constant
- Combinatorial chemistry
- Chinese monoid
- Chip-firing game
- Cobham's theorem
- Coins in a fountain
- Combination
- Combinatorial class
- Combinatorial data analysis
- Combinatorial explosion
- Combinatorial matrix theory
- Combinatorial modelling
- Combinatorial number system
- Combinatorial topology
- Composition (combinatorics)
- Constant-recursive sequence
- Constraint counting
- Counting lemma
- Cycle index
- Cyclic order
- Cyclic sieving
D
E
F
I
L
- Langford pairing
- Large set (combinatorics)
- Largest small octagon
- Laver table
- Lehmer code
- Li Shanlan identity
- Lindström–Gessel–Viennot lemma
- Linear recurrence with constant coefficients
- Littlewood–Offord problem
- Longest alternating subsequence
- Longest common subsequence
- Longest increasing subsequence
- Longest repeated substring problem
- Lottery mathematics
- Lovász local lemma
- Lubell–Yamamoto–Meshalkin inequality
M
P
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