Category:Combinatorics Information

• ► Combinatorialists‎ (4 C, 197 P)
• ► Theorems in combinatorics‎ (27 P)

A

• ► Additive combinatorics‎ (1 C, 17 P)
• ► Algebraic combinatorics‎ (47 P)
• ► Combinatorial algorithms‎ (5 C, 22 P)

C

• ► Combinatorial chemistry‎ (9 P)
• ► Combinatorial design‎ (2 C, 18 P)
• ► Combinatorial game theory‎ (4 C, 59 P)
• ► Combinatorics journals‎ (16 P)

D

• ► Discrepancy theory‎ (5 P)

E

• ► Enumerative combinatorics‎ (2 C, 59 P)

F

• ► Factorial and binomial topics‎ (2 C, 106 P)

G

• ► Graph theory‎ (24 C, 111 P)

I

• ► Incidence geometry‎ (1 C, 36 P)
• ► Integer sequences‎ (9 C, 90 P)

M

• ► Matroid theory‎ (3 C, 64 P)

P

• ► Percolation theory‎ (9 P)
• ► Permutations‎ (5 C, 81 P)
• ► Polyhedral combinatorics‎ (23 P)

Q

• ► Q-analogs‎ (60 P)

R

• ► Ramsey theory‎ (1 C, 35 P)

S

• ► Set families‎ (2 C, 59 P)
• ► Sieve theory‎ (13 P)
• ► Sparse matrices‎ (21 P)
• ► Special functions‎ (8 C, 138 P)
• ► Sumsets‎ (1 C, 16 P)

W

• ► Combinatorics on words‎ (4 C, 69 P)

Σ

• ► Combinatorics stubs‎ (88 P)

• Combinatorics

*

• Combinatorial principles
• Combinatorics and dynamical systems
• Combinatorics and physics
• Extremal combinatorics

+

• History of combinatorics
• Index of combinatorics articles
• Outline of combinatorics

0–9

• 3-dimensional matching

A

• Aanderaa–Karp–Rosenberg conjecture
• Algorithmic Lovász local lemma
• Algorithms and Combinatorics
• Alignments of random points
• All-pairs testing
• Arrangement of hyperplanes
• De Arte Combinatoria

B

• Baker–Campbell–Hausdorff formula
• Barycentric-sum problem
• Bent function
• Bhargava factorial
• Binomial coefficient
• Combinatorial biology
• Block design
• Block walking
• Blocking set
• Borsuk–Ulam theorem
• Butcher group

C

• Cameron–Erdős conjecture
• Catalan's constant
• Combinatorial chemistry
• Chinese monoid
• Chip-firing game
• Coins in a fountain
• Combination
• Combinatorial class
• Combinatorial data analysis
• Combinatorial explosion
• Combinatorial matrix theory
• Combinatorial modelling
• Combinatorial number system
• Combinatorial topology
• Composition (combinatorics)
• Constraint counting
• Crank of a partition
• Cycle index
• Cyclic order
• Cyclic sieving

D

• De Bruijn torus
• Delannoy number
• Dickson's lemma
• Difference set
• DIMACS
• Dinitz conjecture
• Discrete Morse theory
• Disjunct matrix
• Dittert conjecture
• Dividing a circle into areas
• Dobiński's formula
• Domino tiling

E

• Equiangular lines
• Erdős conjecture on arithmetic progressions
• Erdős sumset conjecture
• Erdős–Graham problem
• Erdős–Szemerédi theorem
• Extremal Problems For Finite Sets

F

• Factorial
• Factorial number system
• Finite geometry
• Finite topological space
• First passage percolation
• Free convolution

G

• Generalized arithmetic progression
• Geometric combinatorics
• Glaisher's theorem
• Graph dynamical system
• Group testing

H

• Hafnian
• Hook length formula
• Hunt–Szymanski algorithm

I

• Ideal ring bundle
• Incidence matrix
• Incidence structure
• Independence system
• Infinitary combinatorics
• Interval order
• Inversion (discrete mathematics)
• Isolation lemma

J

• Johnson scheme
• Josephus problem

K

• Kalmanson combinatorial conditions
• Kemnitz's conjecture
• Athanasius Kircher
• Ky Fan lemma

L

• Langford pairing
• Large set (combinatorics)
• Laver table
• Lehmer code
• Li Shanlan identity
• Lindström–Gessel–Viennot lemma
• Littlewood–Offord problem
• Longest alternating subsequence
• Longest common subsequence problem
• Longest increasing subsequence
• Longest repeated substring problem
• Lottery mathematics
• Lovász local lemma
• Lubell–Yamamoto–Meshalkin inequality

M

• M. Lothaire
• Markov spectrum
• Meander (mathematics)
• Method of distinguished element
• Multi-index notation
• Multipartition
• Murnaghan–Nakayama rule
• Musikalisches Würfelspiel

N

• National Resident Matching Program
• Natural density
• No-three-in-line problem

O

• Orthogonal array

P

• Partial permutation
• Partition (number theory)
• Partition of a set
• Pascal's rule
• Percolation
• Perfect ruler
• ♯P-completeness of 01-permanent
• Petkovšek's algorithm
• Piecewise syndetic set
• Pigeonhole principle
• Plethystic substitution
• Polynomial method in combinatorics
• Probabilistic method

Q

• Q-analog
• Q-Vandermonde identity

R

• Random permutation statistics
• Rank of a partition
• Recurrence relation
• Riordan array
• Road coloring theorem
• Rota–Baxter algebra
• Rudin's conjecture
• Rule of division (combinatorics)
• Rule of product
• Rule of sum

S

• Semilinear set
• Sequential dynamical system
• Seriation (statistics)
• Series multisection
• Set packing
• Sharp-SAT
• Shortest common supersequence problem
• Shuffle algebra
• Sicherman dice
• Sidon sequence
• Sim (pencil game)
• Singmaster's conjecture
• Solid partition
• 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

T

• Toida's conjecture
• Toothpick sequence
• Topological combinatorics
• Trace monoid
• Transversal (combinatorics)
• Transylvania lottery
• Tucker's lemma
• Twelvefold way

U

• Umbral calculus
• Uniform convergence in probability
• Using the Borsuk–Ulam Theorem

V

• Virtual knot

W

• Weighing matrix
• Wilf–Zeilberger pair

Z

• Zero-sum problem