- Fields of mathematics
- >
- Discrete mathematics
- >
- Combinatorics
- >
- Theorems in combinatorics

- Fields of mathematics
- >
- Discrete mathematics
- >
- Theorems in discrete mathematics
- >
- Theorems in combinatorics

- Mathematical problems
- >
- Mathematical theorems
- >
- Theorems in discrete mathematics
- >
- Theorems in combinatorics

- Mathematics
- >
- Fields of mathematics
- >
- Combinatorics
- >
- Theorems in combinatorics

- Mathematics
- >
- Mathematical theorems
- >
- Theorems in discrete mathematics
- >
- Theorems in combinatorics

- Theorems
- >
- Mathematical theorems
- >
- Theorems in discrete mathematics
- >
- Theorems in combinatorics

Kneser's theorem (combinatorics)

In the branch of mathematics known as additive combinatorics, Kneser's theorem can refer to one of several related theorems regarding the sizes of certain sumsets in abelian groups. These are named af

Bruck–Ryser–Chowla theorem

The Bruck–Ryser–Chowla theorem is a result on the combinatorics of block designs that implies nonexistence of certain kinds of design. It states that if a (v, b, r, k, λ)-design exists with v = b (a s

Bondy's theorem

In mathematics, Bondy's theorem is a bound on the number of elements needed to distinguish the sets in a family of sets from each other. It belongs to the field of combinatorics, and is named after Jo

Hockey-stick identity

In combinatorial mathematics, the identity or equivalently, the mirror-image by the substitution : is known as the hockey-stick, Christmas stocking identity, boomerang identity, or Chu's Theorem. The

Erdős–Fuchs theorem

In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of elements of a given additive basis, s

Labelled enumeration theorem

In combinatorial mathematics, the labelled enumeration theorem is the counterpart of the Pólya enumeration theorem for the labelled case, where we have a set of labelled objects given by an exponentia

Szemerédi–Trotter theorem

The Szemerédi–Trotter theorem is a mathematical result in the field of Discrete geometry. It asserts that given n points and m lines in the Euclidean plane, the number of incidences (i.e., the number

Schur's theorem

In discrete mathematics, Schur's theorem is any of several theorems of the mathematician Issai Schur. In differential geometry, Schur's theorem is a theorem of Axel Schur. In functional analysis, Schu

MacMahon's master theorem

In mathematics, MacMahon's master theorem (MMT) is a result in enumerative combinatorics and linear algebra. It was discovered by Percy MacMahon and proved in his monograph Combinatory analysis (1916)

Hall's marriage theorem

In mathematics, Hall's marriage theorem, proved by Philip Hall, is a theorem with two equivalent formulations:
* The combinatorial formulation deals with a collection of finite sets. It gives a neces

Kruskal–Katona theorem

In algebraic combinatorics, the Kruskal–Katona theorem gives a complete characterization of the f-vectors of abstract simplicial complexes. It includes as a special case the Erdős–Ko–Rado theorem and

Erdős–Tetali theorem

In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fix

Bertrand's ballot theorem

In combinatorics, Bertrand's ballot problem is the question: "In an election where candidate A receives p votes and candidate B receives q votes with p > q, what is the probability that A will be stri

Lagrange inversion theorem

In mathematical analysis, the Lagrange inversion theorem, also known as the Lagrange–Bürmann formula, gives the Taylor series expansion of the inverse function of an analytic function.

Ahlswede–Daykin inequality

The Ahlswede–Daykin inequality, also known as the four functions theorem (or inequality), is a correlation-type inequality for four functions on a finite distributive lattice. It is a fundamental tool

Corners theorem

In arithmetic combinatorics, the corners theorem states that for every , for large enough , any set of at least points in the grid contains a corner, i.e., a triple of points of the form with . It was

Folkman's theorem

Folkman's theorem is a theorem in mathematics, and more particularly in arithmetic combinatorics and Ramsey theory. According to this theorem, whenever the natural numbers are partitioned into finitel

Baranyai's theorem

In combinatorial mathematics, Baranyai's theorem (proved by and named after Zsolt Baranyai) deals with the decompositions of complete hypergraphs.

Pólya enumeration theorem

The Pólya enumeration theorem, also known as the Redfield–Pólya theorem and Pólya counting, is a theorem in combinatorics that both follows from and ultimately generalizes Burnside's lemma on the numb

Lindström–Gessel–Viennot lemma

In Mathematics, the Lindström–Gessel–Viennot lemma provides a way to count the number of tuples of non-intersecting lattice paths, or, more generally, paths on a directed graph. It was proved by Gesse

Dilworth's theorem

In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum numbe

Szemerédi's theorem

In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with posit

Stanley's reciprocity theorem

In combinatorial mathematics, Stanley's reciprocity theorem, named after MIT mathematician Richard P. Stanley, states that a certain functional equation is satisfied by the generating function of any

Mnëv's universality theorem

In algebraic geometry, Mnëv's universality theorem is a result which can be used to represent algebraic (or semi algebraic) varieties as realizations of oriented matroids, a notion of combinatorics.

Erdős–Rado theorem

In partition calculus, part of combinatorial set theory, a branch of mathematics, the Erdős–Rado theorem is a basic result extending Ramsey's theorem to uncountable sets. It is named after Paul Erdős

Mirsky's theorem

In mathematics, in the areas of order theory and combinatorics, Mirsky's theorem characterizes the height of any finite partially ordered set in terms of a partition of the order into a minimum number

XYZ inequality

In combinatorial mathematics, the XYZ inequality, also called the Fishburn–Shepp inequality, is an inequality for the number of linear extensions of finite partial orders. The inequality was conjectur

© 2023 Useful Links.