Rare card
Ramsey's theorem
- Value
- 50 W
- Attack
- 264
- Defence
- 211
- Players
- 0
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).
Get Ramsey's theorem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack