Ramsey's theorem
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques
en-US/ˈɹæmziz ˈθɪɹəm/
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques