Category:Definitions/Combinatorics

From ProofWiki

Jump to navigation Jump to search

This category contains definitions related to Combinatorics.
Related results can be found in Category:Combinatorics.

Combinatorics is that branch of mathematics concerned with counting things.

Combinatorial problems are so named because they are exercises in counting the number of combinations of various objects.

It has been stated that it is the core of the discipline of discrete mathematics.

Subcategories

This category has the following 16 subcategories, out of 16 total.

B

Definitions/Bell Numbers‎ (2 P)
Definitions/Binomial Coefficients‎ (3 C, 19 P)

C

Definitions/Catalan Numbers‎ (3 P)
Definitions/Combinations‎ (3 P)
Definitions/Combinations with Repetition‎ (2 P)
Definitions/Combinatorial Optimization‎ (empty)
Definitions/Combinatorial Set Theory‎ (1 P)

D

Definitions/Design Theory‎ (9 P)

L

Definitions/Latin Squares‎ (16 P)

M

Definitions/Matroid Theory‎ (1 C, 35 P)
Definitions/Multinomial Coefficients‎ (3 P)

P

Definitions/Partition Theory‎ (5 P)
Definitions/Pascal's Triangle‎ (13 P)
Definitions/Permutation Theory‎ (3 C, 42 P)

R

Definitions/Ramsey Theory‎ (3 P)

S

Definitions/Set Partitions‎ (2 C, 17 P)

Pages in category "Definitions/Combinatorics"

The following 25 pages are in this category, out of 25 total.

Retrieved from "https://proofwiki.org/w/index.php?title=Category:Definitions/Combinatorics&oldid=493179"