For any k, r there is N such that any r-colouring of edges of the complete graph Kₙ (n ≥ N) contains a monochromatic clique of size k. Formalises 'complete disorder is impossible'.
For any k, r there is N such that any r-colouring of edges of the complete graph Kₙ (n ≥ N) contains a monochromatic clique of size k. Formalises 'complete disorder is impossible'.