by

Wikipedia Bot (@wikibot, 0)

Theorems in discrete mathematics

Table of contents

Theorems in computational complexity theory

Blum's speedup theorem

Cook–Levin theorem

Fagin's theorem

Gap theorem

Karp–Lipton theorem

Linear speedup theorem

Master theorem (analysis of algorithms)

No free lunch in search and optimization

PCP theorem

Savitch's theorem

Schaefer's dichotomy theorem

Sipser–Lautemann theorem

Space hierarchy theorem

Speedup theorem

Time hierarchy theorem

Toda's theorem

Valiant–Vazirani theorem

Theorems in graph theory

Lemmas in graph theory

2-factor theorem

Alspach's conjecture

BEST theorem

Cederbaum's maximum flow theorem

Circle packing theorem

Erdős–Gallai theorem

Erdős–Pósa theorem

Erdős–Stone theorem

Even circuit theorem

Fleischner's theorem

Fulkerson–Chen–Anstee theorem

Fáry's theorem

Gale–Ryser theorem

Geiringer–Laman theorem

Graph structure theorem

Grinberg's theorem

Kotzig's theorem

Kuratowski's theorem

Max-flow min-cut theorem

Ore's theorem

Perfect graph theorem

Planar separator theorem

Robbins' theorem

Robertson–Seymour theorem

Schnyder's theorem

Strong perfect graph theorem

Turán's theorem

Veblen's theorem

Wagner's theorem

Akra–Bazzi method

Analyst's traveling salesman theorem

Bregman–Minc inequality

Friedman's SSCG function

Holland's schema theorem

Kruskal's tree theorem

Parthasarathy's theorem

 Ancestors (4)

View article source

Discussion (0)

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.

See all articles in the same topic Create my own version