Error

• Combinatorialists‎ (1 C, 229 P)
• Theorems in combinatorics‎ (29 P)

A

• Additive combinatorics‎ (19 P)
• Algebraic combinatorics‎ (48 P)
• Combinatorial algorithms‎ (5 C, 23 P)

C

• Combinatorial chemistry‎ (9 P)
• Combinatorial game theory‎ (1 C, 64 P)

E

• Enumerative combinatorics‎ (2 C, 60 P)

F

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

G

• Graph theory‎ (20 C, 138 P)

I

• Incidence geometry‎ (1 C, 40 P)
• Integer sequences‎ (6 C, 229 P)

M

• Matroid theory‎ (3 C, 67 P)

P

• Percolation theory‎ (13 P)
• Permutations‎ (2 C, 87 P)
• Polyhedral combinatorics‎ (24 P)

Q

• Q-analogs‎ (59 P)

R

• Ramsey theory‎ (1 C, 41 P)

S

• Set families‎ (8 P)
• Sparse matrices‎ (22 P)
• Special functions‎ (8 C, 151 P)

T

• Triangles of numbers‎ (30 P)

• Combinatorics

*

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

+

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

3

• 3-dimensional matching

A

• Aanderaa–Karp–Rosenberg conjecture
• Addition Principle
• Addition principle
• Algorithmic Lovász local lemma
• Algorithms and Combinatorics
• Astronomy:Alignments of random points
• All-pairs testing
• Arrangement of hyperplanes

B

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

C

• Cameron–Erdős conjecture
• Catalan's constant
• Chemistry:Combinatorial chemistry
• Chinese monoid
• Chip-firing game
• Cobham's theorem
• Coins in a fountain
• Combination
• Combinatorial class
• Combinatorial data analysis
• Combinatorial explosion
• Physics:Combinatorial hierarchy
• Combinatorial matrix theory
• Combinatorial modelling
• Combinatorial number system
• Combinatorial topology
• Composition (combinatorics)
• Constant-recursive sequence
• Constraint counting
• Counting lemma
• Covering problems
• Cycle index
• Cyclic order
• Cyclic sieving

D

• De Arte Combinatoria
• 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–Graham problem
• Erdős–Szemerédi theorem
• Erdős sumset conjecture
• Extremal Problems For Finite Sets

F

• Factorial
• Factorial number system
• Finite geometry
• Finite topological space
• First passage percolation
• Fishburn–Shepp inequality
• Free convolution
• Frobenius characteristic map

G

• Generalized arithmetic progression
• Geometric combinatorics
• Graph dynamical system
• Group testing

H

• Hafnian
• Hall-Littlewood polynomial
• Hook length formula
• Hunt–McIlroy algorithm
• 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
• Biography:Athanasius Kircher
• Ky Fan lemma

L

• Langford pairing
• Large set (combinatorics)
• Largest small octagon
• Laver table
• Lehmer code
• Lindström–Gessel–Viennot lemma
• Linear recurrence with constant coefficients
• Littlewood–Offord problem
• Longest alternating subsequence
• Longest common 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
• Multinomial theorem
• 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
• Sharp-P-completeness of 01-permanent
• ♯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
• Recurrence relation
• Riordan array
• Road coloring theorem
• Rota–Baxter algebra
• Rudin's conjecture
• Rule of division (combinatorics)
• Rule of product
• Rule of sum

S

• Selberg sieve
• Semilinear set
• Sequential dynamical system
• Seriation (statistics)
• Series multisection
• Set packing
• Sharp-SAT
• Shortest common supersequence
• Shortest common supersequence problem
• Shuffle algebra
• Sicherman dice
• Sidon sequence
• Software:Sim (pencil 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

T

• Tau function (integrable systems)
• Toida's conjecture
• Toothpick sequence
• Topological combinatorics
• Trace monoid
• Transversal (combinatorics)
• Transylvania lottery
• Tucker's lemma
• Turan sieve
• Twelvefold way

U

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

V

• Virtual knot

W

• Weighing matrix
• Wilf–Zeilberger pair