Category:Theorems in combinatorics
 | Computing portal |
Here is a list of articles in the category Theorems in combinatorics of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Theorems in combinatorics"
The following 25 pages are in this category, out of 25 total.
B
- Baranyai's theorem (computing)
- Bertrand's ballot theorem (computing)
- Bondy's theorem (computing)
- Bruck–Ryser–Chowla theorem (computing)
C
- Corners theorem (computing)
D
- Dilworth's theorem (computing)
E
- Erdős–Fuchs theorem (computing)
- Erdős–Rado theorem (computing)
- Erdős–Tetali theorem (computing)
F
- Folkman's theorem (computing)
H
- Hall's marriage theorem (computing)
- Hockey-stick identity (computing)
K
- Kneser's theorem (combinatorics) (computing)
- Kruskal–Katona theorem (computing)
L
- Labelled enumeration theorem (computing)
- Lagrange inversion theorem (computing)
- Lindström–Gessel–Viennot lemma (computing)
M
- MacMahon Master theorem (computing)
- Mirsky's theorem (computing)
- Mnëv's universality theorem (computing)
P
- Pólya enumeration theorem (computing)
S
- Schur's theorem (computing)
- Stanley's reciprocity theorem (computing)
- Szemerédi's theorem (computing)
- Szemerédi–Trotter theorem (computing)
Mathematics
Organizations
Books
About