Ramsey's theorem
Sign in to savecombinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques