Ramsey's theorem
en.wikipedia.org · saved by 1 readers
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.