# Ramsey theory

**Ramsey theory**, named for

Frank P. Ramsey, is a branch of

mathematics that studies the conditions under which order must appear. Problems in Ramsey theory typically ask a question of the form: how many elements of some structure
must there be to guarantee that a particular property will hold? An oft-quoted slogan for the subject is: "Complete disorder is impossible."

Suppose, for example, that we know that n pigeons have been housed in m pigeonholes. How big must n be before we can be sure that
at least one pigeonhole houses at least two
pigeons? The answer is the pigeonhole principle: if n > m, then at least one pigeonhole will have at least two pigeons in it. Ramsey's theorem generalizes this principle as explained below.

A typical result in Ramsey theory starts with some mathematical structure, which
is then cut into pieces. How big must the original structure be in
order to ensure that at least one of the pieces has some interesting property?

For example, consider a complete graph of order *n*, that is, there are *n* vertices (dots) and each vertex is connected to every other vertex by an *edge* (a line). A complete
graph of order 3 is called a triangle. Now color every edge red or blue. How large must *n* be in order to ensure that there is either a blue triangle or a
red triangle? It turns out that
the answer is 6. See the article on Ramsey's theorem for a rigorous proof.

Another way to express this result is as follows: at any party with at least six people, there are either three people who are all mutual acquaintances (each one knows the
other two) or mutual strangers (each one does not know either of the other two).

This also is a special case of Ramsey's theorem, which says that for any given integer *c*, any given integers *n*_{1},...,*n*_{c}, there is a number, *R(n*_{1},...,n_{c};c), such that if the edges of a complete graph of
order *R(n*_{1},...,n_{c};c) are colored with *c* different colors, then for some *i* between 1 and c, it must contain a complete subgraph of order *n*_{i} whose edges are all color *i*. The special case above has *c* = 2 and *n*_{1} = *n*_{2} = 3.

Two other key theorems of Ramsey theory are:

- Van der Waerden's theorem: For any given
*c* and *n*, there is a number *V*, such that if the elements of an arithmetic progression of *V* numbers are colored with *c* different colors, then it must contain an arithmetic progression of length *n* whose elements are all the same color.

- Hales-Jewett theorem: For any given
*n*, and *c*, there is a number *H* such that if the cells of a *H*-dimensional *n*×*n*×*n*×...×*n* cube are colored with *c* colors, there must be one row, column, etc. of length *n* all of whose cells are the same color. That is, if you play on a board with sufficiently many directions, then tic-tac-toe-*n*-in-a-row is a forced win for the first player, no matter how large *n* is, and no matter how many people are playing.

## See also