Category:Theorems in combinatorics

Pages in category "Theorems in combinatorics"

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

Next items are not visible in browsers without Javascript

A

  • Ahlswede–Daykin inequality

B

  • Baik–Deift–Johansson theorem
  • Baranyai's theorem
  • Beck–Fiala theorem
  • Bertrand's ballot theorem
  • Bondy's theorem
  • Bruck–Ryser–Chowla theorem

C

  • Cameron–Fon-Der-Flaass IBIS theorem
  • Cobham's theorem
  • Corners theorem

D

  • Dejean's theorem
  • Dilworth's theorem

E

  • Eberhard's theorem
  • Erdős–Fuchs theorem
  • Erdős–Rado theorem
  • Erdős–Tetali theorem

F

  • Fine and Wilf's theorem
  • Folkman's theorem

G

  • Gowers' theorem
  • Graham–Rothschild theorem

H

  • Hall's marriage theorem
  • Hockey-stick identity

K

  • Kneser's theorem (combinatorics)
  • Kruskal–Katona theorem

L

  • Labelled enumeration theorem
  • Lagrange inversion theorem
  • Lindström–Gessel–Viennot lemma

M

  • MacMahon's master theorem
  • Mirsky's theorem
  • Mnëv's universality theorem

P

  • Pólya enumeration theorem

S

  • Schur's theorem
  • Stanley's reciprocity theorem
  • Szemerédi–Trotter theorem
  • Szemerédi's theorem

U

  • Upper bound theorem

X

  • XYZ inequality
Next items are not visible in browsers without Javascript

This category content has been reduced to only pages contained in the ZIM file.

Categories:
  • Theorems in discrete mathematics
  • Combinatorics
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.