Topic
Ramsey's theorem.
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques
The journal
Open the journal →The conversation starts in the journal — be the first to post.
About Ramsey's theorem
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling of a sufficiently large complete graph.
Everything about Ramsey's theorem →