Ramsey's theorem

Statement in mathematical combinatorics

In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. As the simplest example, consider two colours (say, blue and red). Let r and s be any two positive integers.

From Wikipedia, under CC BY-SA. More on occurri.