Ramsey's Theorem
Combinatorics 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.
Wikidata