In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. As the simplest example, consider two colours (say, blue and red).
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. As the simplest example, consider two colours (say, blue and red).
Source: Wikipedia "Ramsey's theorem" · CC BY-SA 4.0
Share this article: X · Bluesky