Category:Combinatorics stubs

• Template:Combin-stub

0–9

• 0,1-simple lattice

A

• AF-heap
• Algebraic enumeration
• Alternation (formal language theory)
• Andrásfai graph

B

• Baik–Deift–Johansson theorem
• Broken space diagonal

C

• Cake number
• Cameron–Erdős conjecture
• Cayley's mousetrap
• Chinese monoid
• Colored matroid
• Combinatorial biology
• Combinatorial data analysis
• Combinatorial matrix theory
• Combinatorics and dynamical systems
• Cooling and heating (combinatorial game theory)
• Cutting sequence

D

• Descartes snark
• Disjunction property of Wallman
• Disperser
• Dittert conjecture
• Double-star snark

E

• Edge-matching puzzle
• Erdős sumset conjecture
• Euclidean shortest path
• Extremal combinatorics

F

• Free matroid

G

• Geometric combinatorics
• Greedy randomized adaptive search procedure

H

• Higher spin alternating sign matrix
• Higman's lemma

I

• Independence system

J

• Johnson scheme

K

• Kalmanson combinatorial conditions
• Kemnitz's conjecture

L

• Laminar set family
• Largest small octagon
• Lieb's square ice constant
• Littlewood–Offord problem
• Logarithmically concave sequence
• Longest repeated substring problem
• Loopless algorithm

M

• Major index
• Milliken–Taylor theorem
• Multipartition

N

• Network dynamics

P

• Pandiagonal magic cube
• Perfect ruler

Q

• Q-theta function
• Quasi-polynomial

R

• Ramsey class
• Random minimum spanning tree
• Ranked poset
• Replacement product
• Rudin's conjecture

S

• Séminaire Lotharingien de Combinatoire
• Semiperfect magic cube
• Seriation (statistics)
• Shortest-path tree
• Sperner property of a partially ordered set
• Spt function
• Starlike tree
• Steiner travelling salesman problem
• Szekeres snark

T

• T-theory
• Toida's conjecture
• Transylvania lottery

U

• Uniform tree

W

• Watkins snark

Z

• Zero-sum problem
• Zero-sum Ramsey theory