Category:Combinatorics
Articles and media on this topic in other Wikimedia projects can be found at: Commons Category Combinatorics Wikimedia Commons has media related to: CombinatoricsCombinatorics 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 13 subcategories, out of 14 total.
C
G
I
L
M
O
Q
R
S
Pages in category "Combinatorics"
The following 187 pages are in this category, out of 193 total. Updates to this list can occasionally be delayed for a few days.
A
- Algebraic combinatorics
- Algebraic enumeration
- All-pairs testing
- Alternating sign matrix
- Analytic combinatorics
- Antichain
- Antimatroid
- Arrangement of hyperplanes
- Association scheme
- Automatic sequence
B
- Barycentric-sum problem
- Bell polynomials
- Bertrand's ballot theorem
- Bijective proof
- Binomial coefficient
- Block walking
- Borsuk–Ulam theorem
- Bracelet (combinatorics)
- Bruck–Chowla–Ryser theorem
- Building (mathematics)
C
- Cameron–Erdős conjecture
- Catalan's constant
- Catalan's problem
- Circle packing theorem
- Clutter (mathematics)
- Combinadic
- Combination
- Combinatorial class
- Combinatorial commutative algebra
- Combinatorial data analysis
- Combinatorial design
- Combinatorial enumeration
- Combinatorial explosion (communication)
- Combinatorial principles
- Combinatorial proof
- Combinatorial species
- Combinatorics
- Constraint counting
- Coupon collector's problem (generating function approach)
- Covering problem
- Cycle decomposition
- Cycle index
- Cyclic order
D
- DIMACS
- De Arte Combinatoria
- De Bruijn digraph
- De Bruijn sequence
- Delannoy number
- Dickson's lemma
- Difference set
- Dilworth's theorem
- Dinitz conjecture
- Discrete Morse theory
- Dividing a circle into areas
- Dobinski's formula
- Dominance order
- Domino tiling
- Double counting (proof technique)
E
E cont.
- Erdős conjecture on arithmetic progressions
- Erdős–Graham conjecture
- Eulerian number
- European Journal of Combinatorics
- Examples of generating functions
- Exponential formula
- Extremal combinatorics
F
- Faà di Bruno's formula
- Factoradic
- Factorial
- Fibonacci word
- Formal power series
- Freiman's theorem
- Fundamental theorem of combinatorial enumeration
- Fuzzy transportation
G
- Generalised Morse sequence
- Generalized arithmetic progression
- Generating function
- Glaisher's theorem
- Gomory's theorem
- Graded poset
- Graph transformation
- Greedoid
- Green–Tao theorem
H
I
- Incidence algebra
- Incidence matrix
- Incidence structure
- Inclusion-exclusion principle
- Infinitary combinatorics
J
K
L
- LLT polynomial
- Labelled enumeration theorem
- Lagrange reversion theorem
- Langford pairing
- Laver table
- List of factorial and binomial topics
- List of partition topics
- Littlewood-Offord problem
- Littlewood–Richardson rule
- Longest common subsequence problem
- Longest increasing subsequence
- Lottery mathematics
- Lovász local lemma
- Lubell-Yamamoto-Meshalkin inequality
- Lyndon word
M
- Macdonald polynomial
- Marriage theorem
- Method of distinguished element
- Möbius inversion formula
- Moreau's necklace-counting function
- Motzkin number
- Multi-index notation
- Multiplicities of entries in Pascal's triangle
N
N cont.
O
P
- Partition (number theory)
- Partition of a set
- Pascal's rule
- Percolation
- Percolation theory
- Perfect ruler
- Permanent is sharp-P-complete
- Permutation
- Piecewise syndetic set
- Pigeonhole principle
- Plane partition
- Poly-Bernoulli number
- Pólya enumeration theorem
- Probabilistic method
- Proizvolov's identity
- Prüfer sequence
Q
R
- Random permutation statistics
- Restricted sumset
- Road coloring problem
- Rook polynomial
- Rule of product
- Rule of sum
S
- Schröder number
- Schubert variety
- Sequential dynamical system
- Set packing
- Shift space
- Shortest common supersequence
- Sicherman dice
- Sieve theory
- Sim (pencil game)
- Small set (combinatorics)
- Sparse matrix
- Sperner's lemma
- Squarefree word
- Stable marriage problem
- Stable roommates problem
- Stanley's reciprocity theorem
- Stanley-Wilf conjecture
- Star product
- Stars and bars (probability)
- Stirling numbers and exponential generating functions
- Sturmian word
- Sum-free sequence
- Sum-free set
- Sumset
- Superpattern
- Symbolic combinatorics
- Symmetric function
- Szemerédi's theorem
T
- Theory of relations
- Thue-Morse sequence
- Topological combinatorics
- Transversal
- Tropical geometry
- Tucker's lemma
- Twelvefold way
Link former page on this page
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
http://wikipedia.atpedia.jp/wiki/%E9%BA%BB%E5%A9%86%E8%B1%86%E8%85%90
-
http://wikipedia.atpedia.jp/wiki/%E7%94%9F%E4%B9%B3
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0